Recent Papers
-
Cuckoo Hashing
- Moni Naor, Gil Segev and Udi Wieder,
History-Independent Cuckoo Hashing, ICALP 2008.
Abstract,
Postscript,
gzipped
Postscript,
PDF.
Slides: ppt.
- Yuriy Arbitman, Moni Naor and Gil Segev, De-amortized Cuckoo
Hashing: Provable Worst-Case Performance and Experimental Results,
Abstract,
PDF.
- Yuriy Arbitman, Moni Naor and Gil Segev,
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct
Representation,
Abstract,
PDF.
Slides: pptx.
- Slides in Hebrew (Shimon Even Memorial talk)
- Cynthia Dwork, Moni Naor and Hoteck Wee,
Pebbling and Proofs of Work,
CRYPTO 2005.
Abstract,
Postscript,
gzipped Postscript, PDF
- Differential Privacy
- Cynthia Dwork and Moni Naor,
On the Difficulties of Disclosure Prevention in Statistical Databases
or The Case for Differential Privacy.
Abstract,
Postscript,
gzipped Postscript, PDF.
- Cynthia Dwork, Krishnaram Kenthapadi,
Frank McSherry, Ilya Mironov and Moni Naor, Our Data, Ourselves: Privacy via
Distributed Noise Generation, Eurocrypt 2006.
Abstract, Postscript,
gzipped
Postscript, PDF.
- Cynthia Dwork, Moni Naor, Omer Reingold, Guy Rothblum, and Salil Vadhan,
On the Complexity of Differentially Private Data Release, STOC
2009,
Abstract,
PDF.
Full Paper.
- Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum and Sergey Yekhanin,
Pan-Private Streaming Algorithms, in Proceedings of The First Symposium on
Innovations in Computer Science (ICS 2010),
Abstract,
PDF.
- Cynthia Dwork, Moni Naor, Toniann Pitassi and Guy N. Rothblum,
Differential Privacy Under Continual
Observation, STOC 2010,
Abstract,
PDF.
- Cynthia Dwork and Moni Naor, Zaps and Their Applications, SIAM Journal on Computing, Volume 36(6),
pp. 1513-1543, 2007.
Abstract,
Postscript ,
gzipped Postscript, PDF.
- Cynthia Dwork, Moni Naor and Omer Reingold, Immunizing
Encryption Schemes from Decryption Errors, Proc EUROCRYPT
2004, 342-360.
Abstract,
Postscript ,
gzipped Postscript, PDF. Slides:
ppt.
- Ron Fagin, Amnon Lotem and Moni Naor,
Optimal aggregation algorithms for middleware, JCSS 66(4), 2003,
pp. 614--656.
Abstract,
Postscript,
gzipped Postscript, PDF.
- Ronen Gradwohl, Moni Naor, Benny Pinkas and Guy Rothblum,
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles,
FUN 2007,
Abstract,
Postscript,
gzipped Postscript, PDF.
-
Ran Halprin and Moni Naor,
Games for Extracting Randomness,
Symposium On Usable Privacy and Security (SOUPS) 2009,
Abstract,
PDF. Slides:
ppt.
- Compressibility:
- Danny Harnik, Moni Naor, Omer Reingold and Alon Rosen,
Completeness in Two-Party Secure Computation - A Computational View.
Proc. STOC 2004
Abstract,
Postscript,
gzipped Postscript, PDF.
- Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold and Alon
Rosen, On Robust Combiners for Oblivious Transfer and other
Primitives, Eurocrypt 2005. Abstract, Postscript, gzipped
Postscript. Slides: ppt.
- Eyal Kaplan, Moni Naor and Omer Reingold,
Derandomized Constructions of k-Wise (Almost) Independent Permutations,
Random 2005. Abstract,
Postscript,
gzipped Postscript,
PDF, Slides: ppt
- Games and Exchanging Information:
- Gillat Kol and Moni Naor, Games for Exchanging Information,
Abstract,
Postscript,
gzipped Postscript,
PDF.
Slides: ppt.
- Gillat Kol and Moni Naor, Cryptography and Game Theory: Designing Protocols for Exchanging Information, TCC 2008,
Abstract,
Postscript,
gzipped Postscript,
PDF.
-
The Scratch-Off papers
- Tal Moran and Moni Naor, Basing
Cryptographic Protocols on Tamper-Evident
Seals, ICALP 2005.
Abstract,
Postscript,
gzipped Postscript, PDF.
- Tal Moran and Moni Naor, Polling with Physical
Envelopes: A Rigorous Analysis of a Human-Centric Protocol, Eurocrypt 2006.
Abstract,
Postscript ,
gzipped Postscript ,
PDF.
-
Voting with Everlasting Privacy:
- Ilya Mironov, Moni Naor and Gil Segev, Sketching in Adversarial
Environments, STOC 2008.
Abstract,
PDF.
- Tal Moran, Moni Naor and Gil Segev, Deterministic
History-Independent Strategies for Storing Information on Write-Once
Memories, ICALP 2007. Abstract, Postscript,
gzipped
Postscript,
PDF.
Slides:
short talk (ppt),
long talk (ppt).
- Tal Moran, Moni Naor and Gil Segev, An Optimally Fair Coin Toss,
TCC 2009.
Abstract, Postscript,
gzipped
Postscript,
PDF.
- Moni Naor, On Fairness in the Carpool Problem,
Journal of Algorithms 55(1), 2005, pp. 93-98.
Abstract,
Postscript,
gzipped Postscript, PDF.
- Memory Checking
Moni Naor and Guy N. Rothblum,
The Complexity of Online Memory Checking, Abstract, Postscript, gzipped
Postscript, PDF.
Moni Naor and Guy N. Rothblum, Simulating
Secret Knowledge:
The Learnability of Adaptively Changing Distributions, Abstract, Postscript, gzipped Postscript,
PDF.
Moni Naor and Gil Segev, Public-Key Cryptosystems
Resilient to Key Leakage.
Abstract,
PDF.
Moni Naor, Gil Segev and Adam Smith,
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models,
CRYPTO 2006 and IEEE Transactions on Information Theory 2008.
Abstract,
PDF.
Slides:
ppt.
Peer-to-Peer and Dynamic networks:
- Moni Naor and Udi Wieder, Novel Architectures for P2P Applications: the
Continuous-Discrete Approach, ACM Trans. Algorithms, vol. 3, no. 3,
2007, PDF.
Moni
Naor and Udi
Wieder, Scalable and Dynamic Quorum Systems, Distributed Computing
17(4): 311-322 (2005),
Postscript,
gzipped Postscript, PDF
Moni Naor and Udi Wieder,
Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small
Worlds, IPTPS 2004.
Postscript, gzipped Postscript, PDF.
- G. S. Manku, M. Naor, U.
Wieder, Know thy Neighbor's Neighbor: The Power of Lookahead in
Randomized P2P Networks, STOC 2004, PDF.
Dalit Naor,
Moni Naor, Protecting Cryptographic Keys:
The Trace and
Revoke Approach,
Abstract,
Postscript,
gzipped Postscript.
On-line papers: All
on-line papers, By topic,
Technical Reports.
Back Home