On Simulation-Sound Trapdoor Commitments
PHILIP D. MACKENZIE, Ke Yang · Lecture notes in computer science · 2004
Cited by 110 works. doi:10.1007/978-3-540-24676-3_23
Authors
References
- The complexity of theorem-proving procedures
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Minimum disclosure proofs of knowledge
- Coin flipping by telephone a protocol for solving impossible problems
- Non-malleable cryptography
- One-way functions are necessary and sufficient for secure signatures
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
- Coin Flipping by Telephone.
- Universally composable security: a new paradigm for cryptographic protocols
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems