Moni Naor |
|
|---|---|
Author's Web Page  | |
| 49 papers in database with 6679 citations  Editor of 2 conference proceedings books H-number: 32 | |
Conference Proceedings |
|
 | 1. Moni Naor, editor, Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings. Springer, 2007. ISBN 3-540-72539-3. [Papers] Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia. |
| 2. Moni Naor, editor, Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings. Springer, 2004. ISBN 3-540-21000-8. [Papers] Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia. | |
Journal Papers |
|
| 1. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen, Completeness in Two-Party Secure Computation: A Computational View, Journal of Cryptology,
Volume 19(4), pp. 521 - 552,
Springer, 2006. [  Cited
7 times
] | |
| 2. Moni Naor, Benny Pinkas, Computationally Secure Oblivious Transfer, Journal of Cryptology,
Volume 18(1), pp. 1 - 35,
Springer, 2005. [ Cited
26 times
] | |
| 3. Moni Naor, Omer Reingold, Constructing Pseudo-Random Permutations with a Prescribed Structure, Journal of Cryptology,
Volume 15(2), pp. 97 - 102,
Springer, 2002. [ Cited
18 times
] | |
| 4. Moni Naor, Omer Reingold, On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited, Journal of Cryptology,
Volume 12(1), pp. 29 - 66,
Springer, 1999. [ Cited
213 times
 ] | |
| 5. Cynthia Dwork, Moni Naor, An Efficient Existentially Unforgeable Signature Scheme and Its Applications, Journal of Cryptology,
Volume 11(3), pp. 187 - 208,
Springer, 1998. [ Cited
86 times
] | |
| 6. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, Perfect Zero-Knowledge Arguments for , Journal of Cryptology,
Volume 11(2), pp. 87 - 108,
Springer, 1998. [ Cited
80 times
] | |
| 7. Russell Impagliazzo, Moni Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum, Journal of Cryptology,
Volume 9(4), pp. 199 - 216,
Springer, 1996. [ Cited
145 times
] | |
| 8. Moni Naor, Bit Commitment Using Pseudorandomness, Journal of Cryptology,
Volume 4(2), pp. 151 - 158,
Springer, 1991. [ Cited
330 times
] | |
Conference Papers |
|
| 1. Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek, Hedged Public-Key Encryption: How to Protect against Bad Randomness, pp. 232 - 249, ASIACRYPT 2009. [  Electronic
Edition][Cited
4 times
] | |
| 2. Moni Naor, Gil Segev, Public-Key Cryptosystems Resilient to Key Leakage, pp. 18 - 35, CRYPTO 2009. [ Electronic
Edition][Cited
39 times
] | |
| 3. Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan, How Efficient Can Memory Checking Be?, pp. 503 - 520, TCC 2009. [ Electronic
Edition][Cited
14 times
] | |
| 4. Tal Moran, Moni Naor, Gil Segev, An Optimally Fair Coin Toss, pp. 1 - 18, TCC 2009. [ Electronic
Edition][Cited
11 times
] | |
| 5. Ilya Mironov, Moni Naor, Gil Segev, Sketching in adversarial environments, pp. 651 - 660, STOC 2008. [ Electronic
Edition][Cited
1 times
] | |
| 6. Gillat Kol, Moni Naor, Cryptography and Game Theory: Designing Protocols for Exchanging Information, pp. 320 - 339, TCC 2008. [ Electronic
Edition][Cited
52 times
] | |
| 7. Danny Harnik, Moni Naor, On the Compressibility of NP Instances and Cryptographic Applications, pp. 719 - 728, FOCS 2006. [ Electronic
Edition][Cited
32 times
] | |
| 8. Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor, Our Data, Ourselves: Privacy Via Distributed Noise Generation, pp. 486 - 503, EUROCRYPT 2006. [ Electronic
Edition][ IACR Online
Archive ][Cited
73 times
] | |
| 9. Tal Moran, Moni Naor, Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol, pp. 88 - 108, EUROCRYPT 2006. [ Electronic
Edition][IACR Online
Archive][Cited
14 times
] | |
| 10. Moni Naor, Gil Segev, Adam Smith, Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models, pp. 214 - 231, CRYPTO 2006. [ Electronic
Edition][IACR Online
Archive][Cited
20 times
] | |
| 11. Tal Moran, Moni Naor, Receipt-Free Universally-Verifiable Voting with Everlasting Privacy, pp. 373 - 392, CRYPTO 2006. [ Electronic
Edition][IACR Online
Archive][Cited
63 times
] | |
| 12. Cynthia Dwork, Moni Naor, Hoeteck Wee, Pebbling and Proofs of Work, pp. 37 - 54, CRYPTO 2005. [ Electronic
Edition][IACR Online
Archive][Cited
9 times
] | |
| 13. Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen, On Robust Combiners for Oblivious Transfer and Other Primitives, pp. 96 - 113, EUROCRYPT 2005. [ Electronic
Edition][IACR Online
Archive][Cited
42 times
] | |
| 14. Moni Naor, Asaf Nussboim, Eran Tromer, Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs, pp. 66 - 85, TCC 2005. [ Electronic
Edition][IACR Online
Archive][Cited
8 times
] | |
| 15. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen, Completeness in two-party secure computation: a computational view, pp. 252 - 261, STOC 2004. [ Electronic
Edition][Cited
8 times
] | |
| 16. Cynthia Dwork, Moni Naor, Omer Reingold, Immunizing Encryption Schemes from Decryption Errors, pp. 342 - 360, EUROCRYPT 2004. [ Electronic
Edition][IACR Online
Archive][Cited
20 times
] | |
| 17. Moni Naor, On Cryptographic Assumptions and Challenges, pp. 96 - 109, CRYPTO 2003. [ Electronic
Edition][IACR Online
Archive][Cited
70 times
] | |
| 18. Cynthia Dwork, Andrew Goldberg, Moni Naor, On Memory-Bound Functions for Fighting Spam, pp. 426 - 444, CRYPTO 2003. [ Electronic
Edition][IACR Online
Archive][Cited
149 times
] | |
| 19. Moni Naor, Deniable Ring Authentication, pp. 481 - 498, CRYPTO 2002. [ Electronic
Edition][IACR Online
Archive][Cited
88 times
] | |
| 20. Dalit Naor, Moni Naor, Jeffery Lotspiech, Revocation and Tracing Schemes for Stateless Receivers, pp. 41 - 62, CRYPTO 2001. [ Electronic
Edition][IACR Online
Archive][Cited
488 times
] | |
| 21. Moni Naor, Benny Pinkas, Distributed Oblivious Transfer, pp. 205 - 219, ASIACRYPT 2000. [ Electronic
Edition][Cited
57 times
] | |
| 22. Dan Boneh, Moni Naor, Timed Commitments, pp. 236 - 254, CRYPTO 2000. [ Electronic
Edition][IACR Online
Archive][Cited
118 times
] | |
| 23. Moni Naor, Benny Pinkas, Efficient Trace and Revoke Schemes, pp. 1 - 20, FC 2000. [ Electronic
Edition][Cited
172 times
] | |
| 24. Moni Naor, Benny Pinkas, Oblivious Transfer with Adaptive Queries, pp. 573 - 590, CRYPTO 1999. [ Electronic
Edition][Cited
80 times
] | |
| 25. Moni Naor, Benny Pinkas, Omer Reingold, Distributed Pseudo-random Functions and KDCs, pp. 327 - 346, EUROCRYPT 1999. [ Electronic
Edition][Cited
81 times
] | |
| 26. Moni Naor, Benny Pinkas, Threshold Traitor Tracing, pp. 502 - 517, CRYPTO 1998. [ Electronic
Edition][Cited
113 times
] | |
| 27. Moni Naor, Omer Reingold, From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract), pp. 267 - 282, CRYPTO 1998. [ Electronic
Edition][Cited
47 times
] | |
| 28. Moni Naor, Benny Pinkas, Secure and Efficient Metering, pp. 576 - 590, EUROCRYPT 1998. [ Electronic
Edition][Cited
79 times
] | |
| 29. Matt Blaze, Joan Feigenbaum, Moni Naor, A Formal Treatment of Remotely Keyed Encryption, pp. 251 - 265, EUROCRYPT 1998. [ Electronic
Edition][Cited
59 times
] | |
| 30. Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky, Deniable Encryption, pp. 90 - 104, CRYPTO 1997. [ Electronic
Edition][Cited
141 times
] | |
| 31. Moni Naor, Benny Pinkas, Visual Authentication and Identification, pp. 322 - 336, CRYPTO 1997. [ Electronic
Edition][Cited
164 times
] | |
| 32. Benny Chor, Amos Fiat, Moni Naor, Tracing Traitors, pp. 257 - 270, CRYPTO 1994. [ Electronic
Edition][Cited
462 times
] | |
| 33. Cynthia Dwork, Moni Naor, An Efficient Existentially Unforgeable Signature Scheme and its Applications, pp. 234 - 246, CRYPTO 1994. [ Electronic
Edition][Cited
100 times
] | |
| 34. Moni Naor, Adi Shamir, Visual Cryptography, pp. 1 - 12, EUROCRYPT 1994. [ Electronic
Edition][Cited
678 times
] | |
| 35. Peter Gemmell, Moni Naor, Codes for Interactive Authentication, pp. 355 - 367, CRYPTO 1993. [ Electronic
Edition][Cited
41 times
] | |
| 36. Amos Fiat, Moni Naor, Broadcast Encryption, pp. 480 - 491, CRYPTO 1993. [ Electronic
Edition][Cited
760 times
] | |
| 37. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract), pp. 196 - 214, CRYPTO 1992. [ Electronic
Edition][Cited
12 times
] | |
| 38. Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra, Low Communication 2-Prover Zero-Knowledge Proofs for NP, pp. 215 - 227, CRYPTO 1992. [ Electronic
Edition][Cited
19 times
] | |
| 39. Cynthia Dwork, Moni Naor, Pricing via Processing or Combatting Junk Mail, pp. 139 - 147, CRYPTO 1992. [ Electronic
Edition][Cited
417 times
] | |
| 40. Moni Naor, Bit Commitment Using Pseudo-Randomness, pp. 128 - 136, CRYPTO 1989. [ Electronic
Edition][Cited
136 times
] | |
| 41. David Chaum, Amos Fiat, Moni Naor, Untraceable Electronic Cash, pp. 319 - 327, CRYPTO 1988. [ Electronic
Edition][Cited
926 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals