(PhD Student)





I am a final year PhD Student from Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur. I am working under the supervision of Prof. Sandeep K. Shukla and was extremely fortunate to be advised by (Late) Prof. Pramod Subramanyan during his short stay at IIT Kanpur. We are exploring problems in two genres: formal methods & their application to prove security properties, and applied cryptography, specifically zero knowledge proofs, to build trusted and privacy-preserving solutions.

I also had interest in Computational Number Theory and Algebra, but am not pursuing it currently. In this area, I have worked on Integer Factorization problem, and explored the problem from a novel perspective. We investigated for a connection between the Integer Factorization and AKS Primality test, by examining the polynomial computed during AKS test and see if we can use it to compute the factors of the integer.



    1. Working out an example with CEGAR ( November 2016 )

    2. Detecting Insider Attacks on Databases using Blockchains (November 2017)


    Date Title of the talk Venue
    August 18, 2018 Zero Knowledge proofs and its applications in Blockchain (Invited Talk) IIIT Allahabad, India
    June 3, 2018 Interactive Proofs, Zero Knowledge Proofs and zkSNARKs IBM Research, Bangalore, India
    May 10, 2017 Formal Verification of Cryptographic Protocols (SOTA Seminar) IIT Kanpur, India
    November 17, 2016 Counter Example Guided Abstraction Refinement (CEGAR) IIT Kanpur, India
    August 16, 2016 Analysis of Cryptographic Protocols using Formal Methods IIT Kanpur, India
    February 11, 2016 Factoring Integers using small algebraic dependencies Tel Aviv University, Israel
    September 25, 2015 Computing Arbitrary functions of encrypted data IIT Kanpur, India
    April 5, 2014 Primality Testing : Is Randomization worth practicing? IIT Kanpur, India
    January 16, 2014 Factorizing Integers via Diophantine Approximation IIT Kanpur, India
    November 18, 2013 The smallest enclosing circle problem IIT Kanpur, India


    Course ID Course Name Project
    CS 601 Mathematics for Computer Science Not Applicable
    CS 602 Design and Analysis of Algorithms Not Applicable
    CS 628 Computer Systems Security Not Applicable
    CS 634 Mobile Computing Real Time Location Sensitive Emergency Alert System
    CS 640 Computational Complexity Theory Primality Testing : Is randomization worth practicing?
    CS 641 Modern Cryptology Not Applicable
    CS 647 Advanded Data Structures and Algorithms Not Applicable
    CS 648 Randomized Algorithms Emperical Analysis of algorithms for Minimum Enclosing Circle
    CS 652 Computer Aided Verification Formal Verification of UPI Protocol by NPCI
    CS 653 Functional Programming Smart Classification using Bayesian Monads
    CS 654 Software Architecture Domain Specific Search Engine Framework
    CS 698D Special Topics in Data Compression Not Applicable


    CS - 108, HR Kadim Diwan Building,
    Department of Computer Science and Engineering, IIT Kanpur
    Uttar Pradesh - 208016, INDIA
    (+91) 512 - 2597028
    ssahai [AT]
    ssahai [AT]