Zero-knowledge proofs solve a fundamental problem: how can you prove you know something without revealing what you know? For instance, consider proving you know the solution to a sudoku puzzle without showing the completed grid. In general, a zero-knowledge proof aims to convince a verifier that a statement is true while revealing nothing beyond its validity. Zero-knowledge proofs enable verification without trust in a range of secure systems, including user authentication, privacy-preserving blockchain transactions and other advanced cryptographic protocols.

Our group has contributed to both the foundational theory and practical efficiency of zero knowledge. This ranges from introducing fundamental techniques like OR composition [Read here], which allows proving knowledge of at least one secret from a set without revealing which one, to more recent work on designing highly optimized zero knowledge protocols for real-world applications, such as the MPC-in-the-head paradigm [Read1, Read2].

Zero-knowledge proofs are a key building block in the design of secure, privacy-preserving systems. They enable trustworthy verification without requiring the verifier to access sensitive information. This capability underpins a wide range of applications, from secure user authentication and confidential blockchain transactions to broader cryptographic protocols that enhance privacy and security in digital infrastructure.