Identity-Based Deterministic Signature Scheme Without Forking-Lemma


December 22, 2012



Prof. Pandu Rangan

I focus my research in the design of pragmatic algorithms. Problems of practical interest in Graph Theory, Combinatorics and Computational Geometry often turn out to be NP-complete or very hard to solve that we have to look for pragmatic alternatives for them. We explore the avenues such as 1) Restricting the problem domain 2) Approximate algorithm design 3)Randomized Algorithms 4) Parallel and VLSI Algorithms and 5) Cryptography Applications. Our design strategies are neither special purpose (very specific to a problem) nor general purpose (which are too inefficient)but broad purpose ones. Thus our research efforts can be summarised in a single term – Application Oriented Paradigm Design (AOPD) (one more acronym to the world of Computer Science!). In Cryptology my current focus is on Secure message transmission and Provable security of cryptographic protocols / primitives.