Strong proofs of knowledge
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- Foundations of Cryptography
- Foundations of Cryptography
- Lower bounds for non-black-box zero knowledge
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Strict Polynomial-Time in Simulation and Extraction
- The Knowledge Complexity of Interactive Proof Systems
- Zero-knowledge proofs of identity
Cited in
(8)- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- Expected-time cryptography: generic techniques and applications to concrete soundness
- On probabilistic versus deterministic provers in the definition of proofs of knowledge
- scientific article; zbMATH DE number 6008725 (Why is no real title available?)
- scientific article; zbMATH DE number 176509 (Why is no real title available?)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- Generalized proofs of knowledge with fully dynamic setup
- scientific article; zbMATH DE number 1335878 (Why is no real title available?)
This page was built for publication: Strong proofs of knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088175)