From P Versus NP to Probabilistic and Zero Knowledge Proof Systems
- 2 April 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (4) , 119-130
Abstract
I present an overview of the field of zero knowledge proof systems, which has evolved considerably over the last four decades, with applications ranging from secure authentication, secure communications, crypto-currency, and online privacy.Keywords
This publication has 14 references indexed in Scilit:
- Graph isomorphism in quasipolynomial time [extended abstract]2016
- A Note on Constant-Round Zero-Knowledge Proofs for NP2004
- IP=PSPACE (interactive proof=polynomial space)2002
- Foundations of Cryptography2001
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000
- The Graph Isomorphism Problem1993
- Algebraic methods for interactive proof systemsJournal of the ACM, 1992
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- Private coins versus public coins in interactive proof systems1986