Research
Our research focuses on developing cryptographic protocols with real world applications specifically under the following topics:
Post-Quantum Cryptography
Post-quantum cryptography (PQC) aims to develop classical cryptographic algorithms that remain secure even against adversaries equipped with large-scale quantum computers.
See more →
Current Interests
Implementation Security
Protecting PQC implementations against side-channel attacks (timing, power analysis, electromagnetic emanations) is challenging. Many lattice-based schemes involve operations that are difficult to implement in constant time without significant performance penalties.
Standardization and Migration
NIST has finalized its first set of PQC standards, but migrating existing infrastructure is a massive engineering task. Hybrid approaches combining classical and post-quantum algorithms adds even more complexity to the table.
Lattice Problems
Most promising PQC candidates rely on the hardness of lattice problems (LWE, NTRU, Module-LWE). Understanding the precise hardness of these problems, especially against quantum algorithms beyond Shor's.
Our goal is to develop efficient, side-channel resistant implementations of post-quantum cryptographic schemes suitable for real-world deployment.
Zero-Knowledge Proofs
Zero-knowledge proofs (ZKPs) allow one party to prove knowledge of a secret without revealing any information about the secret itself. They have become fundamental building blocks for blockchain scalability, privacy-preserving authentication, and verifiable computation.
See more →
Current Interests
Post-Quantum ZKPs
Most efficient ZKP systems (SNARKs based on pairings) rely on assumptions broken by quantum computers. Developing efficient post-quantum zero-knowledge proofs, potentially based on lattices remains challenging. Interestingly, most of the current schemes are hash based proof systems. Since hash functions have much less structure compared to lattices, we are interested in developing lattice based schemes that are as performant as the hash based ones.
Hardware Acceleration
ZKP proving involves computationally intensive operations like multi-scalar multiplication (MSM) and number-theoretic transforms (NTT). We are interested in desinging efficient GPU implementations for these operations is an active area of research.
Memory Requirements & Distributed Proving
Many ZKP systems require storing large amounts of intermediate data during proof generation. Memory consumption can become a bottleneck for complex proofs, especially on resource-constrained devices. We are interested in designing protocols for environments where the intermediate date does not fit to a single prover memory.
Digital Signatures
Digital signatures provide authentication, integrity, and non-repudiation for digital communications. They are ubiquitous in secure protocols, software distribution, identity systems and blockchains. The transition to post-quantum secure signatures presents both challenges and opportunities.
See more →
Current Interests
Aggregation and Batch Verification
Techniques like signature aggregation (combining multiple signatures into one) are well-developed for pairing-based schemes but harder for lattice-based signatures. Efficient batch verification is also less developed for PQ schemes. Batch verification has a direct impact in the real world such as solving scaling problems for the PQ version of the Ethereum blockchain.
Threshold and Multi-Signatures
Distributing signing authority across multiple parties (threshold signatures) or allowing multiple signers (multi-signatures) is important for key management. Efficient constructions for post-quantum schemes are still maturing.
Our goal is to design compact, efficient post-quantum signature schemes with practical threshold and aggregation capabilities.