Strengthening Zero-Knowledge Protocols Using Signatures
Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang · Lecture notes in computer science · 2003
Cited by 76 works. doi:10.1007/3-540-39200-9_11
Authors
References
- The complexity of theorem-proving procedures
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- The Knowledge Complexity of Interactive Proof Systems
- How to play ANY mental game
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Non-malleable cryptography
- One-way functions are necessary and sufficient for secure signatures
- Public-key cryptosystems provably secure against chosen ciphertext attacks
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing