The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Moni Naor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Chaum, Amos Fiat, Moni Naor
    Untraceable Electronic Cash. [Citation Graph (1, 0)][DBLP]
    CRYPTO, 1988, pp:319-327 [Conf]
  2. Amos Fiat, Moni Naor
    Implicit O(1) Probe Search [Citation Graph (1, 0)][DBLP]
    STOC, 1989, pp:336-344 [Conf]
  3. Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
    Non-Oblivious Hashing (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:367-376 [Conf]
  4. Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
    Storing and Searching a Multikey Table (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:344-353 [Conf]
  5. Moni Naor, Moti Yung
    Universal One-Way Hash Functions and their Cryptographic Applications [Citation Graph (1, 0)][DBLP]
    STOC, 1989, pp:33-43 [Conf]
  6. Moni Naor, Avishai Wool
    The Load, Capacity, and Availability of Quorum Systems. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:423-447 [Journal]
  7. Eyal Kaplan, Moni Naor, Omer Reingold
    Derandomized Constructions of k-Wise (Almost) Independent Permutations. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:354-365 [Conf]
  8. Moni Naor, Benny Pinkas
    Distributed Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:205-219 [Conf]
  9. Moni Naor, Avishai Wool
    Access Control and Signatures via Quorum Secret Sharing. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1996, pp:157-168 [Conf]
  10. Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky
    Deniable Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:90-104 [Conf]
  11. Dan Boneh, Moni Naor
    Timed Commitments. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:236-254 [Conf]
  12. Benny Chor, Amos Fiat, Moni Naor
    Tracing Traitors. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:257-270 [Conf]
  13. Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra
    Low Communication 2-Prover Zero-Knowledge Proofs for NP. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:215-227 [Conf]
  14. Cynthia Dwork, Andrew Goldberg, Moni Naor
    On Memory-Bound Functions for Fighting Spam. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:426-444 [Conf]
  15. Cynthia Dwork, Moni Naor
    Pricing via Processing or Combatting Junk Mail. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:139-147 [Conf]
  16. Cynthia Dwork, Moni Naor
    An Efficient Existentially Unforgeable Signature Scheme and its Applications. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:234-246 [Conf]
  17. Cynthia Dwork, Moni Naor, Hoeteck Wee
    Pebbling and Proofs of Work. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:37-54 [Conf]
  18. Amos Fiat, Moni Naor
    Broadcast Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:480-491 [Conf]
  19. Peter Gemmell, Moni Naor
    Codes for Interactive Authentication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:355-367 [Conf]
  20. Moni Naor
    Deniable Ring Authentication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:481-498 [Conf]
  21. Moni Naor
    On Cryptographic Assumptions and Challenges. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:96-109 [Conf]
  22. Moni Naor
    Bit Commitment Using Pseudo-Randomness. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:128-136 [Conf]
  23. Dalit Naor, Moni Naor, Jeffery Lotspiech
    Revocation and Tracing Schemes for Stateless Receivers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:41-62 [Conf]
  24. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
    Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:196-214 [Conf]
  25. Moni Naor, Benny Pinkas
    Visual Authentication and Identification. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:322-336 [Conf]
  26. Moni Naor, Benny Pinkas
    Threshold Traitor Tracing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:502-517 [Conf]
  27. Moni Naor, Benny Pinkas
    Oblivious Transfer with Adaptive Queries. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:573-590 [Conf]
  28. Moni Naor, Omer Reingold
    From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:267-282 [Conf]
  29. Moni Naor, Gil Segev, Adam Smith
    Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:214-231 [Conf]
  30. Tal Moran, Moni Naor
    Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:373-392 [Conf]
  31. Matt Blaze, Joan Feigenbaum, Moni Naor
    A Formal Treatment of Remotely Keyed Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:251-265 [Conf]
  32. Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor
    Our Data, Ourselves: Privacy Via Distributed Noise Generation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:486-503 [Conf]
  33. Cynthia Dwork, Moni Naor, Omer Reingold
    Immunizing Encryption Schemes from Decryption Errors. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:342-360 [Conf]
  34. Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
    On Robust Combiners for Oblivious Transfer and Other Primitives. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:96-113 [Conf]
  35. Tal Moran, Moni Naor
    Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:88-108 [Conf]
  36. Moni Naor, Benny Pinkas
    Secure and Efficient Metering. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:576-590 [Conf]
  37. Moni Naor, Benny Pinkas, Omer Reingold
    Distributed Pseudo-random Functions and KDCs. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:327-346 [Conf]
  38. Moni Naor, Adi Shamir
    Visual Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1994, pp:1-12 [Conf]
  39. Moni Naor, Benny Pinkas
    Efficient Trace and Revoke Schemes. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2000, pp:1-20 [Conf]
  40. Noga Alon, Moni Naor
    Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:46-54 [Conf]
  41. Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi
    Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:693-702 [Conf]
  42. Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
    Witnesses for Boolean Matrix Multiplication and for Shortest Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:417-426 [Conf]
  43. Mihir Bellare, Russell Impagliazzo, Moni Naor
    Does Parallel Repetition Lower the Error in Computationally Sound Protocols? [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:374-383 [Conf]
  44. Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
    Checking the Correctness of Memories [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:90-99 [Conf]
  45. Cynthia Dwork, Moni Naor
    Zaps and Their Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:283-293 [Conf]
  46. Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
    Magic Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:523-534 [Conf]
  47. Tomás Feder, Eyal Kushilevitz, Moni Naor
    Amortized Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:239-248 [Conf]
  48. Russell Impagliazzo, Moni Naor
    Efficient Cryptographic Schemes Provably as Secure as Subset Sum [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:236-241 [Conf]
  49. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
    Search Problems in the Decision Tree Model (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:576-585 [Conf]
  50. Rajeev Motwani, Joseph Naor, Moni Naor
    The Probabilistic Method Yields Deterministic Parallel Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:8-13 [Conf]
  51. Moni Naor, Guy N. Rothblum
    The Complexity of Online Memory Checking. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:573-584 [Conf]
  52. Moni Naor, Ron M. Roth
    Optimal File Sharing in Distributed Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:515-525 [Conf]
  53. Moni Naor, Omer Reingold
    Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:170-181 [Conf]
  54. Moni Naor, Omer Reingold
    Number-theoretic Constructions of Efficient Pseudo-random Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:458-467 [Conf]
  55. Moni Naor, Leonard J. Schulman, Aravind Srinivasan
    Splitters and Near-Optimal Derandomization. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:182-191 [Conf]
  56. Moni Naor, Avishai Wool
    The Load, Capacity and Availability of Quorum Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:214-225 [Conf]
  57. Danny Harnik, Moni Naor
    On the Compressibility of NP Instances and Cryptographic Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:719-728 [Conf]
  58. Moni Naor
    Moderately Hard Functions: From Complexity to Spam Fighting. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:434-442 [Conf]
  59. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
    On Dice and Coins: Models of Computation for Random Generation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:319-340 [Conf]
  60. Danny Harnik, Moni Naor
    On Everlasting Security in the Hybrid Bounded Storage Model. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:192-203 [Conf]
  61. Tal Moran, Moni Naor
    Basing Cryptographic Protocols on Tamper-Evident Seals. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:285-297 [Conf]
  62. Moni Naor
    String Matching with Preprocessing of Text and Pattern. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:739-750 [Conf]
  63. Moni Naor, Guy N. Rothblum
    Learning to impersonate. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:649-656 [Conf]
  64. Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
    Multicast Security: A Taxonomy and Some Efficient Constructions. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:708-716 [Conf]
  65. Moni Naor, Udi Wieder
    A Simple Fault Tolerant Distributed Hash Table. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2003, pp:88-97 [Conf]
  66. Moni Naor, Udi Wieder
    Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2004, pp:269-277 [Conf]
  67. Joe Kilian, Moni Naor
    On the Complexity of Statistical Reasoning (extended abtract). [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:209-217 [Conf]
  68. Alain J. Mayer, Moni Naor, Larry J. Stockmeyer
    Local Computations on Static and Dynamic Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:268-278 [Conf]
  69. Nimrod Megiddo, Moni Naor, David P. Anderson
    The Minimum Reservation Rate Problem in Digital Audio/Video Systems. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:43-48 [Conf]
  70. Moni Naor, Sitvanit Ruah
    On the Decisional Complexity of Problems Over the Reals. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:176-187 [Conf]
  71. Amotz Bar-Noy, Joseph Naor, Moni Naor
    One Bit Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1988, pp:66-76 [Conf]
  72. Dahlia Malkhi, Moni Naor, David Ratajczak
    Viceroy: a scalable and dynamic emulation of the butterfly. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:183-192 [Conf]
  73. Moni Naor, Udi Wieder
    Scalable and dynamic quorum systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:114-122 [Conf]
  74. Ronald Fagin, Amnon Lotem, Moni Naor
    Optimal Aggregation Algorithms for Middleware. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  75. Moni Naor, Benny Pinkas, Reuban Sumner
    Privacy preserving auctions and mechanism design. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 1999, pp:129-139 [Conf]
  76. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
    Matching Nuts and Bolts. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:690-696 [Conf]
  77. Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
    Fairness in Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:477-485 [Conf]
  78. Matt Blaze, Joan Feigenbaum, Moni Naor
    A Formal Treatment of Remotely Keyed Encryption. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:868-869 [Conf]
  79. Moni Naor, Benny Pinkas
    Efficient oblivious transfer protocols. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:448-457 [Conf]
  80. Moni Naor, Omer Reingold
    Constructing pseudo-random permutations with a prescribed structure. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:458-459 [Conf]
  81. Moni Naor, Udi Wieder
    Novel architectures for P2P applications: the continuous-discrete approach. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:50-59 [Conf]
  82. Moni Naor, Adi Shamir
    Visual Cryptography II: Improving the Contrast Via the Cover Base. [Citation Graph (0, 0)][DBLP]
    Security Protocols Workshop, 1996, pp:197-202 [Conf]
  83. Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor
    Adaptively Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:639-648 [Conf]
  84. Danny Dolev, Cynthia Dwork, Moni Naor
    Non-Malleable Cryptography (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:542-552 [Conf]
  85. Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor
    Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:489-498 [Conf]
  86. Cynthia Dwork, Moni Naor, Amit Sahai
    Concurrent Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:409-418 [Conf]
  87. Uriel Feige, Joe Kilian, Moni Naor
    A minimal model for secure computation (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:554-563 [Conf]
  88. Amos Fiat, Moni Naor
    Rigorous Time/Space Tradeoffs for Inverting Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:534-541 [Conf]
  89. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
    Completeness in two-party secure computation: a computational view. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:252-261 [Conf]
  90. Sampath Kannan, Moni Naor, Steven Rudich
    Implicit Representation of Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:334-343 [Conf]
  91. Gurmeet Singh Manku, Moni Naor, Udi Wieder
    Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:54-63 [Conf]
  92. Moni Naor
    Evaluation May Be Easier Than Generation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:74-83 [Conf]
  93. Moni Naor, Kobbi Nissim
    Communication preserving protocols for secure function evaluation. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:590-599 [Conf]
  94. Joseph Naor, Moni Naor
    Small-bias Probability Spaces: Efficient Constructions and Applications [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:213-223 [Conf]
  95. Joseph Naor, Moni Naor, Alejandro A. Schäffer
    Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:355-364 [Conf]
  96. Moni Naor, Benny Pinkas
    Oblivious Transfer and Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:245-254 [Conf]
  97. Moni Naor, Omer Reingold
    On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:189-199 [Conf]
  98. Moni Naor, Omer Reingold, Alon Rosen
    Pseudo-random functions and factoring (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:11-20 [Conf]
  99. Moni Naor, Larry J. Stockmeyer
    What can be computed locally? [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:184-193 [Conf]
  100. Moni Naor, Vanessa Teague
    Anti-presistence: history independent data structures. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:492-501 [Conf]
  101. Moni Naor, Moti Yung
    Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:427-437 [Conf]
  102. Moni Naor, Asaf Nussboim, Eran Tromer
    Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:66-85 [Conf]
  103. Uri Nadav, Moni Naor
    The Dynamic And-Or Quorum System. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:472-486 [Conf]
  104. Uri Nadav, Moni Naor
    Fault-Tolerant Storage in a Dynamic Environment. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:390-404 [Conf]
  105. Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
    Rank aggregation methods for the Web. [Citation Graph (0, 0)][DBLP]
    WWW, 2001, pp:613-622 [Conf]
  106. Noga Alon, Moni Naor
    Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:434-449 [Journal]
  107. Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
    Checking the Correctness of Memories. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:2/3, pp:225-244 [Journal]
  108. Ronald Fagin, Moni Naor, Peter Winkler
    Comparing Information Without Leaking It. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1996, v:39, n:5, pp:77-85 [Journal]
  109. Moni Naor, Benny Pinkas
    Secure Accounting and Auditing on the Web. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1998, v:30, n:1-7, pp:541-550 [Journal]
  110. Dalit Naor, Moni Naor
    Protecting Cryptographic Keys: The Trace-and-Revoke Approach. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2003, v:36, n:7, pp:47-53 [Journal]
  111. Moni Naor, Kobbi Nissim
    Communication Complexity and Secure Function Evaluation [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  112. Ronald Fagin, Amnon Lotem, Moni Naor
    Optimal Aggregation Algorithms for Middleware [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  113. Amotz Bar-Noy, Joseph Naor, Moni Naor
    One-Bit Algorithms. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1990, v:4, n:, pp:3-8 [Journal]
  114. Moni Naor, Udi Wieder
    Scalable and dynamic quorum systems. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:17, n:4, pp:311-322 [Journal]
  115. Moni Naor, Kobbi Nissim
    Communication Complexity and Secure Function Evaluation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:062, pp:- [Journal]
  116. Moni Naor, Omer Reingold, Alon Rosen
    Pseudo-Random Functions and Factoring [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:064, pp:- [Journal]
  117. Cynthia Dwork, Moni Naor
    Zaps and Their Applications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:001, pp:- [Journal]
  118. Dalit Naor, Moni Naor, Jeffery Lotspiech
    Revocation and Tracing Schemes for Stateless Receivers [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:043, pp:- [Journal]
  119. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
    Completeness in Two-Party Secure Computation - A Computational View [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:060, pp:- [Journal]
  120. Eyal Kaplan, Moni Naor, Omer Reingold
    Derandomized Constructions of k-Wise (Almost) Independent Permutations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:002, pp:- [Journal]
  121. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
    On Dice and Coins: Models of Computation for Random Generation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:159-174 [Journal]
  122. Moni Naor, Sitvanit Ruah
    On the Decisional Complexity of Problems Over the Reals. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:167, n:1, pp:27-45 [Journal]
  123. Carlo Blundo, Alfredo De Santis, Moni Naor
    Visual cryptography for grey level images. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:6, pp:255-259 [Journal]
  124. Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
    Magic Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:6, pp:852-921 [Journal]
  125. Cynthia Dwork, Moni Naor, Amit Sahai
    Concurrent zero-knowledge. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:851-898 [Journal]
  126. Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
    Nonoblivious Hashing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:764-782 [Journal]
  127. Moni Naor, Omer Reingold
    Number-theoretic constructions of efficient pseudo-random functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:231-262 [Journal]
  128. Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
    Fairness in Scheduling [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:306-357 [Journal]
  129. Moni Naor
    On fairness in the carpool problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:55, n:1, pp:93-98 [Journal]
  130. Ronald Fagin, Amnon Lotem, Moni Naor
    Optimal aggregation algorithms for middleware. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:4, pp:614-656 [Journal]
  131. Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
    An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:3, pp:406-424 [Journal]
  132. Rajeev Motwani, Joseph Naor, Moni Naor
    The Probabilistic Method Yields Deterministic Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:3, pp:478-516 [Journal]
  133. Moni Naor, Omer Reingold
    Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:2, pp:336-375 [Journal]
  134. Cynthia Dwork, Moni Naor
    An Efficient Existentially Unforgeable Signature Scheme and Its Applications. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1998, v:11, n:3, pp:187-208 [Journal]
  135. Russell Impagliazzo, Moni Naor
    Efficient Cryptographic Schemes Provably as Secure as Subset Sum. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:4, pp:199-216 [Journal]
  136. Moni Naor
    Bit Commitment Using Pseudorandomness. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1991, v:4, n:2, pp:151-158 [Journal]
  137. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
    Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1998, v:11, n:2, pp:87-108 [Journal]
  138. Moni Naor, Benny Pinkas
    Computationally Secure Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:1, pp:1-35 [Journal]
  139. Moni Naor, Omer Reingold
    Constructing Pseudo-Random Permutations with a Prescribed Structure. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2002, v:15, n:2, pp:97-102 [Journal]
  140. Moni Naor, Omer Reingold
    On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1999, v:12, n:1, pp:29-66 [Journal]
  141. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
    Completeness in Two-Party Secure Computation: A Computational View. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:4, pp:521-552 [Journal]
  142. Sandy Irani, Moni Naor, Ronitt Rubinfeld
    On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil? [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:2, pp:141-159 [Journal]
  143. Noga Alon, Moni Naor
    Coin-Flipping Games Immune Against Linear-Sized Coalitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:403-417 [Journal]
  144. Danny Dolev, Cynthia Dwork, Moni Naor
    Nonmalleable Cryptography. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:391-437 [Journal]
  145. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan
    Amortized Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:736-750 [Journal]
  146. Amos Fiat, Moni Naor
    Implicit O(1) Probe Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:1-10 [Journal]
  147. Amos Fiat, Moni Naor
    Rigorous Time/Space Trade-offs for Inverting Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:790-803 [Journal]
  148. Joseph Naor, Moni Naor
    Small-Bias Probability Spaces: Efficient Constructions and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:838-856 [Journal]
  149. Joseph Naor, Moni Naor, Alejandro A. Schäffer
    Fast Parallel Algorithms for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:327-349 [Journal]
  150. Moni Naor, Benny Pinkas
    Oblivious Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1254-1281 [Journal]
  151. Moni Naor, Ron M. Roth
    Optimal File Sharing in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:158-183 [Journal]
  152. Moni Naor, Omer Reingold, Alon Rosen
    Pseudorandom Functions and Factoring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1383-1404 [Journal]
  153. Moni Naor, Larry J. Stockmeyer
    What Can be Computed Locally? [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1259-1277 [Journal]
  154. Cynthia Dwork, Moni Naor
    Zaps and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1513-1543 [Journal]
  155. Sampath Kannan, Moni Naor, Steven Rudich
    Implicit Representation of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:596-603 [Journal]
  156. Moni Naor
    A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:3, pp:409-412 [Journal]
  157. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
    Search Problems in the Decision Tree Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:119-132 [Journal]
  158. Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
    Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:509-0 [Journal]
  159. Jehoshua Bruck, Moni Naor
    The hardness of decoding linear codes with preprocessing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:381-385 [Journal]
  160. Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
    Tracing traitors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:893-910 [Journal]
  161. Moni Naor, Alon Orlitsky, Peter W. Shor
    Three results on interactive communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1608-1615 [Journal]
  162. Moni Naor, Avishai Wool
    Access Control and Signatures via Quorum Secret Sharing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:9, pp:909-922 [Journal]
  163. Moni Naor, Asaf Nussboim
    Implementing Huge Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:596-608 [Conf]
  164. Tal Moran, Moni Naor, Gil Segev
    Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:303-315 [Conf]
  165. Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
    Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:166-182 [Conf]
  166. Moni Naor, Udi Wieder
    Novel architectures for P2P applications: The continuous-discrete approach. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  167. Hedged Public-Key Encryption: How to Protect against Bad Randomness. [Citation Graph (, )][DBLP]


  168. Split-ballot voting: everlasting privacy with distributed trust. [Citation Graph (, )][DBLP]


  169. Traitor tracing with constant size ciphertext. [Citation Graph (, )][DBLP]


  170. Public-Key Cryptosystems Resilient to Key Leakage. [Citation Graph (, )][DBLP]


  171. Public-Key Encryption in the Bounded-Retrieval Model. [Citation Graph (, )][DBLP]


  172. De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. [Citation Graph (, )][DBLP]


  173. History-Independent Cuckoo Hashing. [Citation Graph (, )][DBLP]


  174. Informational overhead of incentive compatibility. [Citation Graph (, )][DBLP]


  175. Sketching in adversarial environments. [Citation Graph (, )][DBLP]


  176. Games for exchanging information. [Citation Graph (, )][DBLP]


  177. On the complexity of differentially private data release: efficient algorithms and hardness results. [Citation Graph (, )][DBLP]


  178. Differential privacy under continual observation. [Citation Graph (, )][DBLP]


  179. Cryptography and Game Theory: Designing Protocols for Exchanging Information. [Citation Graph (, )][DBLP]


  180. How Efficient Can Memory Checking Be?. [Citation Graph (, )][DBLP]


  181. An Optimally Fair Coin Toss. [Citation Graph (, )][DBLP]


  182. Games for extracting randomness. [Citation Graph (, )][DBLP]


  183. Pan-Private Streaming Algorithms. [Citation Graph (, )][DBLP]


  184. Derandomized Constructions of k-Wise (Almost) Independent Permutations. [Citation Graph (, )][DBLP]


  185. De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results [Citation Graph (, )][DBLP]


  186. Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation [Citation Graph (, )][DBLP]


  187. Succinct representation of general unlabeled graphs. [Citation Graph (, )][DBLP]


  188. The Complexity of Online Memory Checking. [Citation Graph (, )][DBLP]


  189. On the Compressibility of NP Instances and Cryptographic Applications. [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.053secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002