Removing Interaction from Zero-Knowledge Proofs
From MaRDI portal
Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)
Recommendations
- Noninteractive Zero-Knowledge
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- scientific article; zbMATH DE number 4053065
- scientific article; zbMATH DE number 503349
- Increasing the power of the dealer in non-interactive zero-knowledge proof systems
Cited in
(13)- Trading help for interaction in statistical zero-knowledge proofs
- The power of preprocessing in zero-knowledge proofs of knowledge
- Increasing the power of the dealer in non-interactive zero-knowledge proof systems
- Anonymous NIZK proofs of knowledge with preprocessing
- Interactive proofs under continual memory leakage
- Short non-interactive zero-knowledge proofs
- Zero-Knowledge Proofs with Witness Elimination
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- Zero-knowledge proofs of computational power in the shared string model
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Information Security and Cryptology
This page was built for publication: Removing Interaction from Zero-Knowledge Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4206387)