scientific article; zbMATH DE number 4191124
From MaRDI portal
Publication:3210182
zbMATH Open0722.68063MaRDI QIDQ3210182FDOQ3210182
Publication date: 1990
Title of this publication is not available (Why is that?)
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)
Cited In (15)
- On Efficient Zero-Knowledge PCPs
- Provably Hard Zero-Way Functions
- On the Composition of Zero-Knowledge Proof Systems
- Title not available (Why is that?)
- Polynomial-Space Approximation of No-Signaling Provers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity bounds for zero-test algorithms
- On the communication complexity of zero-knowledge proofs
- Advances in Cryptology - ASIACRYPT 2003
- Perfect zero knowledge: new upperbounds and relativized separations
- On zero-knowledge proofs (extended abstract)
- Title not available (Why is that?)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210182)