| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Moni Naor 116 Cynthia Dwork , Moni Naor: Zaps and Their Applications. Electronic Colloquium on Computational Complexity (ECCC) (001): (2002) 115 Moni Naor, Omer Reingold : Constructing Pseudo-Random Permutations with a Prescribed Structure. Journal of Cryptology 15 (2): 97-102 (2002) 114 Dalit Naor , Moni Naor, Jeffrey B. Lotspiech : Revocation and Tracing Schemes for Stateless Receivers. CRYPTO 2001 : 41-62 113 Ronald Fagin , Amnon Lotem , Moni Naor: Optimal Aggregation Algorithms for Middleware. PODS 2001 112 Moni Naor, Benny Pinkas : Efficient oblivious transfer protocols. SODA 2001 : 448-457 111 Moni Naor, Omer Reingold : Constructing pseudo-random permutations with a prescribed structure. SODA 2001 : 458-459 110 Moni Naor, Vanessa Teague : Anti-presistence: history independent data structures. STOC 2001 : 492-501 109 Moni Naor, Kobbi Nissim : Communication preserving protocols for secure function evaluation. STOC 2001 : 590-599 108 Cynthia Dwork , S. Ravi Kumar , Moni Naor, D. Sivakumar : Rank aggregation methods for the Web. WWW 2001 : 613-622 107 Moni Naor, Kobbi Nissim : Communication Complexity and Secure Function Evaluation. Electronic Colloquium on Computational Complexity (ECCC) 8 (062): (2001) 106 Moni Naor, Omer Reingold , Alon Rosen : Pseudo-Random Functions and Factoring. Electronic Colloquium on Computational Complexity (ECCC) 8 (064): (2001) 105 Moni Naor, Sitvanit Ruah : On the Decisional Complexity of Problems Over the Reals. Information and Computation 167 (1): 27-45 (2001) 104 Moni Naor, Benny Pinkas : Distributed Oblivious Transfer. ASIACRYPT 2000 : 205-219 103 Dan Boneh , Moni Naor: Timed Commitments. CRYPTO 2000 : 236-254 102 Cynthia Dwork , Moni Naor: Zaps and Their Applications. FOCS 2000 : 283-293 101 Moni Naor, Benny Pinkas : Efficient Trace and Revoke Schemes. Financial Cryptography 2000 : 1-20 100 Moni Naor, Omer Reingold , Alon Rosen : Pseudo-random functions and factoring (extended abstract). STOC 2000 : 11-20 99 Carlo Blundo , Alfredo De Santis , Moni Naor: Visual cryptography for grey level images. Information Processing Letters 75 (6): 255-259 (2000) 98 Danny Dolev , Cynthia Dwork , Moni Naor: Nonmalleable Cryptography. SIAM J. Comput. 30 (2): 391-437 (2000) 97 Moni Naor, Benny Pinkas , Reuban Sumner : Privacy preserving auctions and mechanism design. ACM Conference on Electronic Commerce 1999 : 129-139 96 Moni Naor, Benny Pinkas : Oblivious Transfer with Adaptive Queries. CRYPTO 1999 : 573-590 95 Moni Naor, Benny Pinkas , Omer Reingold : Distributed Pseudo-random Functions and KDCs. EUROCRYPT 1999 : 327-346 94 Cynthia Dwork , Moni Naor, Omer Reingold , Larry J. Stockmeyer : Magic Functions. FOCS 1999 : 523-534 93 Ran Canetti , Juan A. Garay , Gene Itkis , Daniele Micciancio , Moni Naor, Benny Pinkas : Multicast Security: A Taxonomy and Some Efficient Constructions. INFOCOM 1999 : 708-716 92 Matt Blaze , Joan Feigenbaum , Moni Naor: A Formal Treatment of Remotely Keyed Encryption. SODA 1999 : 868-869 91 Moni Naor, Benny Pinkas : Oblivious Transfer and Polynomial Evaluation. STOC 1999 : 245-254 90 Moni Naor, Omer Reingold : Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. JCSS 58 (2): 336-375 (1999) 89 Moni Naor, Omer Reingold : On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. Journal of Cryptology 12 (1): 29-66 (1999) 88 Amos Fiat , Moni Naor: Rigorous Time/Space Trade-offs for Inverting Functions. SIAM J. Comput. 29 (3): 790-803 (1999) 87 Moni Naor, Omer Reingold : From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). CRYPTO 1998 : 267-282 86 Moni Naor, Benny Pinkas : Threshold Traitor Tracing. CRYPTO 1998 : 502-517 85 Matt Blaze , Joan Feigenbaum , Moni Naor: A Formal Treatment of Remotely Keyed Encryption. EUROCRYPT 1998 : 251-265 84 Moni Naor, Benny Pinkas : Secure and Efficient Metering. EUROCRYPT 1998 : 576-590 83 Cynthia Dwork , Moni Naor, Amit Sahai : Concurrent Zero-Knowledge. STOC 1998 : 409-418 82 Moni Naor, Avishai Wool : Access Control and Signatures via Quorum Secret Sharing. IEEE Transactions on Parallel and Distributed Systems 9 (9): 909-922 (1998) 81 Miklós Ajtai , James Aspnes , Moni Naor, Yuval Rabani , Leonard J. Schulman , Orli Waarts : Fairness in Scheduling. J. Algorithms 29 (2): 306-357 (1998) 80 Moni Naor, Rafail Ostrovsky , Ramarathnam Venkatesan , Moti Yung : Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. Journal of Cryptology 11 (2): 87-108 (1998) 79 Cynthia Dwork , Moni Naor: An Efficient Existentially Unforgeable Signature Scheme and Its Applications. Journal of Cryptology 11 (3): 187-208 (1998) 78 Moni Naor, Avishai Wool : The Load, Capacity, and Availability of Quorum Systems. SIAM J. Comput. 27 (2): 423-447 (1998) 77 Moni Naor, Benny Pinkas : Secure Accounting and Auditing on the Web. WWW7 / Computer Networks 30 (1-7): 541-550 (1998) 76 Moni Naor, Benny Pinkas : Visual Authentication and Identification. CRYPTO 1997 : 322-336 75 Ran Canetti , Cynthia Dwork , Moni Naor, Rafail Ostrovsky : Deniable Encryption. CRYPTO 1997 : 90-104 74 Mihir Bellare , Russell Impagliazzo , Moni Naor: Does Parallel Repetition Lower the Error in Computationally Sound Protocols? FOCS 1997 : 374-383 73 Moni Naor, Omer Reingold : Number-theoretic Constructions of Efficient Pseudo-random Functions. FOCS 1997 : 458-467 72 Moni Naor, Omer Reingold : On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). STOC 1997 : 189-199 71 Moni Naor, Omer Reingold : On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. Electronic Colloquium on Computational Complexity (ECCC) 4 (5): (1997) 70 Moni Naor, Avishai Wool : Access Control and Signatures via Quorum Secret Sharing. ACM Conference on Computer and Communications Security 1996 : 157-168 69 Moni Naor, Sitvanit Ruah : On the Decisional Complexity of Problems Over the Reals. ISTCS 1996 : 176-187 68 Cynthia Dwork , Jeffrey B. Lotspiech , Moni Naor: Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). STOC 1996 : 489-498 67 Ran Canetti , Uriel Feige , Oded Goldreich , Moni Naor: Adaptively Secure Multi-Party Computation. STOC 1996 : 639-648 66 Moni Naor: Evaluation May Be Easier Than Generation (Extended Abstract). STOC 1996 : 74-83 65 Moni Naor, Adi Shamir : Visual Cryptography II: Improving the Contrast Via the Cover Base. Security Protocols Workshop 1996 : 197-202 64 Noga Alon , Moni Naor: Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. Algorithmica 16 (4/5): 434-449 (1996) 63 Ronald Fagin , Moni Naor, Peter Winkler : Comparing Information Without Leaking It. CACM 39 (5): 77-85 (1996) 62 Russell Impagliazzo , Moni Naor: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Journal of Cryptology 9 (4): 199-216 (1996) 61 Moni Naor, Omer Reingold : Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. FOCS 1995 : 170-181 60 Moni Naor, Leonard J. Schulman , Aravind Srinivasan : Splitters and Near-Optimal Derandomization. FOCS 1995 : 182-191 59 Joe Kilian , Moni Naor: On the Complexity of Statistical Reasoning (extended abtract). ISTCS 1995 : 209-217 58 Alain J. Mayer , Moni Naor, Larry J. Stockmeyer : Local Computations on Static and Dynamic Graphs (Preliminary Version). ISTCS 1995 : 268-278 57 Miklós Ajtai , James Aspnes , Moni Naor, Yuval Ravani , Leonard J. Schulman , Orli Waarts : Fairness in Scheduling. SODA 1995 : 477-485 56 Moni Naor, Omer Reingold : Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions. Electronic Colloquium on Computational Complexity (ECCC) 2 (45): (1995) 55 Moni Naor, Ron M. Roth : Optimal File Sharing in Distributed Networks. SIAM J. Comput. 24 (1): 158-183 (1995) 54 Tomás Feder , Eyal Kushilevitz , Moni Naor, Noam Nisan : Amortized Communication Complexity. SIAM J. Comput. 24 (4): 736-750 (1995) 53 Moni Naor, Larry J. Stockmeyer : What Can be Computed Locally? SIAM J. Comput. 24 (6): 1259-1277 (1995) 52 László Lovász , Moni Naor, Ilan Newman , Avi Wigderson : Search Problems in the Decision Tree Model. SIAM Journal on Discrete Mathematics 8 (1): 119-132 (1995) 51 Cynthia Dwork , Moni Naor: An Efficient Existentially Unforgeable Signature Scheme and its Applications. CRYPTO 1994 : 234-246 50 Benny Chor , Amos Fiat , Moni Naor: Tracing Traitors. CRYPTO 1994 : 257-270 49 Moni Naor, Adi Shamir : Visual Cryptography. EUROCRYPT 1994 : 1-12 48 Moni Naor, Avishai Wool : The Load, Capacity and Availability of Quorum Systems. FOCS 1994 : 214-225 47 Noga Alon , Manuel Blum , Amos Fiat , Sampath Kannan , Moni Naor, Rafail Ostrovsky : Matching Nuts and Bolts. SODA 1994 : 690-696 46 Uriel Feige , Joe Kilian , Moni Naor: A Minimal Model for Secure Computation (Extended Abstract). STOC 1994 : 554-563 45 Manuel Blum , William S. Evans , Peter Gemmell , Sampath Kannan , Moni Naor: Checking the Correctness of Memories. Algorithmica 12 (2/3): 225-244 (1994) 44 Rajeev Motwani , Joseph Naor , Moni Naor: The Probabilistic Method Yields Deterministic Parallel Algorithms. JCSS 49 (3): 478-516 (1994) 43 Peter Gemmell , Moni Naor: Codes for Interactive Authentication. CRYPTO 1993 : 355-367 42 Amos Fiat , Moni Naor: Broadcast Encryption. CRYPTO 1993 : 480-491 41 Nimrod Megiddo , Moni Naor, David P. Anderson : The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993 : 43-48 40 Moni Naor, Larry J. Stockmeyer : What Can Be Computed Locally? (Extended Abstract). STOC 1993 : 184-193 39 David Feldman , Russell Impagliazzo , Moni Naor, Noam Nisan , Steven Rudich , Adi Shamir : On Dice and Coins: Models of Computation for Random Generation. Information and Computation 104 (2): 159-174 (1993) 38 Amos Fiat , Moni Naor: Implicit O(1) Probe Search. SIAM J. Comput. 22 (1): 1-10 (1993) 37 Noga Alon , Moni Naor: Coin-Flipping Games Immune Against Linear-Sized Coalitions. SIAM J. Comput. 22 (2): 403-417 (1993) 36 Joseph Naor , Moni Naor: Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22 (4): 838-856 (1993) 35 Cynthia Dwork , Moni Naor: Pricing via Processing or Combatting Junk Mail. CRYPTO 1992 : 139-147 34 Moni Naor, Rafail Ostrovsky , Ramarathnam Venkatesan , Moti Yung : Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). CRYPTO 1992 : 196-214 33 Cynthia Dwork , Uriel Feige , Joe Kilian , Moni Naor, Muli Safra : Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO 1992 : 215-227 32 Noga Alon , Zvi Galil , Oded Margalit , Moni Naor: Witnesses for Boolean Matrix Multiplication and for Shortest Paths. FOCS 1992 : 417-426 31 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. FOCS 1992 : 693-702 30 Amos Fiat , Moni Naor, Jeanette P. Schmidt , Alan Siegel : Nonoblivious Hashing. JACM 39 (4): 764-782 (1992) 29 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? Mathematical Systems Theory 25 (2): 141-159 (1992) 28 Sampath Kannan , Moni Naor, Steven Rudich : Implicit Representation of Graphs. SIAM Journal on Discrete Mathematics 5 (4): 596-603 (1992) 27 Tomás Feder , Eyal Kushilevitz , Moni Naor: Amortized Communication Complexity (Preliminary Version). FOCS 1991 : 239-248 26 Moni Naor, Ron M. Roth : Optimal File Sharing in Distributed Networks (Preliminary Version). FOCS 1991 : 515-525 25 László Lovász , Moni Naor, Ilan Newman , Avi Wigderson : Search Problems in the Decision Tree Model (Preliminary Version). FOCS 1991 : 576-585 24 Manuel Blum , William S. Evans , Peter Gemmell , Sampath Kannan , Moni Naor: Checking the Correctness of Memories. FOCS 1991 : 90-99 23 Moni Naor: String Matching with Preprocessing of Text and Pattern. ICALP 1991 : 739-750 22 Amos Fiat , Moni Naor: Rigorous Time/Space Tradeoffs for Inverting Functions. STOC 1991 : 534-541 21 Danny Dolev , Cynthia Dwork , Moni Naor: Non-Malleable Cryptography (Extended Abstract). STOC 1991 : 542-552 20 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. JCSS 43 (3): 406-424 (1991) 19 Moni Naor: Bit Commitment Using Pseudorandomness. Journal of Cryptology 4 (2): 151-158 (1991) 18 Moni Naor: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. SIAM Journal on Discrete Mathematics 4 (3): 409-412 (1991) 17 Noga Alon , Moni Naor: Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract). FOCS 1990 : 46-54 16 Joseph Naor , Moni Naor: Small-bias Probability Spaces: Efficient Constructions and Applications. STOC 1990 : 213-223 15 Moni Naor, Moti Yung : Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. STOC 1990 : 427-437 14 Amotz Bar-Noy , Joseph Naor , Moni Naor: One-Bit Algorithms. Distributed Computing 4 : 3-8 (1990) 13 Moni Naor: Bit Commitment Using Pseudo-Randomness. CRYPTO 1989 : 128-136 12 Russell Impagliazzo , Moni Naor: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. FOCS 1989 : 236-241 11 Rajeev Motwani , Joseph Naor , Moni Naor: The Probabilistic Method Yields Deterministic Parallel Algorithms. FOCS 1989 : 8-13 10 David Feldman , Russell Impagliazzo , Moni Naor, Noam Nisan , Steven Rudich , Adi Shamir : On Dice and Coins: Models of Computation for Random Generation. ICALP 1989 : 319-340 9 Moni Naor, Moti Yung : Universal One-Way Hash Functions and their Cryptographic Applications. STOC 1989 : 33-43 8 Amos Fiat , Moni Naor: Implicit O(1) Probe Search. STOC 1989 : 336-344 7 Joseph Naor , Moni Naor, Alejandro A. Schäffer : Fast Parallel Algorithms for Chordal Graphs. SIAM J. Comput. 18 (2): 327-349 (1989) 6 David Chaum , Amos Fiat , Moni Naor: Untraceable Electronic Cash. CRYPTO 1988 : 319-327 5 Amotz Bar-Noy , Joseph Naor , Moni Naor: One Bit Algorithms. PODC 1988 : 66-76 4 Sampath Kannan , Moni Naor, Steven Rudich : Implicit Representation of Graphs. STOC 1988 : 334-343 3 Amos Fiat , Moni Naor, Alejandro A. Schäffer , Jeanette P. Schmidt , Alan Siegel : Storing and Searching a Multikey Table (Extended Abstract). STOC 1988 : 344-353 2 Amos Fiat , Moni Naor, Jeanette P. Schmidt , Alan Siegel : Non-Oblivious Hashing (Extended Abstract). STOC 1988 : 367-376 1 Joseph Naor , Moni Naor, Alejandro A. Schäffer : Fast Parallel Algorithms for Chordal Graphs (Extended Abstract). STOC 1987 : 355-364  DiSC'02 © 2003 Association for Computing Machinery |
