Sanjay Rawat
Assistant Professor
B3- 309
IIIT, Prof. CR Rao Road
Gachibowli, Hyderabad (AP) - 500 032 INDIA
Ph: +(91) 40- 6653 1587
Email: name.surname@iiit.ac.in

Hi... I am a computer science researcher, working in the field of information security. My research journey began during my M.Phil. course when I started studying Cryptography. At some 'carrefour', the journey took a turn in the direction of network security... And I started working on intrusion detection systems which became the subject of my PhD thesis. The journey continued in the same direction until I reached another 'carrefour' to take a turn in the direction of "program analysis and security of software".... Now I am focusing on static/dynamic security program analysis of binary (executable) code and smart fuzzing..
I joined IIIT, Hyderabad as assistant professor. I am part of CSTAR group (Center for Security, Theory & Algorithmic Research)

In the recent past, I worked at Verimag and LIG labs on Vulcain (vulnerability analysis) and DIAMONDS projects.
My CV provides more details.




My research interests include:



Professional Experience:



Teaching:
  • In the distant past, I have taught:

  • My very recent publications (on vulnerability analysis)

    My articles and citations as collected by Google Scholar For some reason, my DBLP entries are messed-up. As a result, it does not reflect the correct state of my publications => do not assess me on the basis of mere DBLP list.

    Tools
    We have released the tool to find "buffer overflow prone" (BOP) functions as described in our SERE 2012 paper. The zipped file of the source code can be downloaded HERE . The same is also available via GITHUB: https://github.com/tosanjay/BOPFunctionRecognition.git. If you use the tool and find it interesting, please cite our SERE paper, as given above in the publication section.
    Some of the other important publications are available on my other home page
    My older home page contains some more information about my work and interest.
    Hmmm... so, working with 1s and 0s is not friendly :) free counters