Bit Commitment Using Pseudo-Randomness (1991)

Cached

Download Links

by Moni Naor
Venue:Journal of Cryptology
Citations:228 - 15 self

Active Bibliography

78 Efficient Cryptographic Schemes Provably as Secure as Subset Sum – Russell Impagliazzo, Moni Naor - 1993
17 Lecture Notes on Cryptography – Shafi Goldwasser, Mihir Bellare - 2001
“METAPROOFS” (and their Cryptographic Applications) – Alfredo De Santis, Moti Yung - 1990
29 Randomness, Interactive Proofs and . . . – Oded Goldreich - 1987
41 Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract) – Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung - 1998
447 Non-Malleable Cryptography – Danny Dolev, Cynthia Dwork, Moni Naor - 2000
19 Complexity and Security of Distributed Protocols – Matthew Keith Franklin - 1993
1 Cryptology – Prof Ronald Rivest, L. Rivest
3 Randomness versus Fault-Tolerance – Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosen - 2000
24 Reducing complexity assumptions for statistically-hiding commitment – Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel - 2005
463 Entity Authentication and Key Distribution – Mihir Bellare, Phillip Rogaway - 1993
22 Separating Distribution-Free And Mistake-Bound Learning Models Over The Boolean Domain – Avrim L. Blum - 1990
13 On the power of the randomized iterate – Iftach Haitner, Danny Harnik, Omer Reingold - 2006
9 Necessary and Sufficient Conditions for Collision-Free Hashing – Alexander Russell - 1995
Interleaved Zero-Knowledge – Oded Goldreich, Shafi Goldwasser, Silvio Micali - 1999
71 Resettable Zero-Knowledge – Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali - 1999
7 Varieties of Secure Distributed Computing – Matthew Franklin, Moti Yung - 1996
Concurrent Knowledge Extraction in the Public-Key Model ∗ – Andrew C. C. Yao, Moti Yung, Yunlei Zhao - 908
Mathematical Foundations of Modern Cryptography: Computational Complexity Perspective – Shafi Goldwasser - 2002