Knowledge complexity of interactive proof systems
- from
- Papers
- added
- 2026-10-10
- likes
- 0
similar
-
Proofs of knowledge cseweb.ucsd.edu
-
Programs and Proofs ilyasergey.net
Book that gives a brief and practically-oriented introduction to interactive proofs in Coq which emphasizes the computational nature of inductive reasoning about decidable propositions via a small set of primitives from the SSReflect proof language.
-
How to construct zero-knowledge proof systems for NP wisdom.weizmann.ac.il
-
-
Another Look at “Provable Security” eprint.iacr.org
-
Multi-Theorem Preprocessing NIZKs from Lattices link.springer.com
Papers › The list > Specific topics > Zero Knowledge Proofs: “By GoldWasser, Micali and Rackoff. Defining computational complexity of "knowledge" within zero knowledge proofs.”