| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 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.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ilya Mironov, Moni Naor, Gil Segev |
Sketching in Adversarial Environments. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Benny Pinkas |
Efficient trace and revoke schemes. |
Int. J. Inf. Sec. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor |
Basing cryptographic protocols on tamper-evident seals. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Halprin, Moni Naor |
Games for extracting randomness. |
ACM Crossroads |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor |
Split-ballot voting: Everlasting privacy with distributed trust. |
ACM Trans. Inf. Syst. Secur. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor |
On the Compressibility of NP Instances and Cryptographic Applications. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor |
The privacy of tracing traitors. |
Digital Rights Management Workshop |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs |
Public-Key Encryption in the Bounded-Retrieval Model. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin |
Pan-Private Streaming Algorithms. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum |
Differential privacy under continual observation. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
privacy, private data analysis |
| 1 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Card shuffling, Connectivity, Block ciphers, Random walk, Pseudo-randomness |
| 1 | Tal Moran, Moni Naor, Gil Segev |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev |
Public-Key Cryptosystems Resilient to Key Leakage. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs |
Public-Key Encryption in the Bounded-Retrieval Model. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
An Optimally Fair Coin Toss. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Guy N. Rothblum |
The complexity of online memory checking. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
Memory checking, authentication |
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum |
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Cryptography, Zero-knowledge proofs, Puzzles |
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Halprin, Moni Naor |
Games for extracting randomness. |
SOUPS |
2009 |
DBLP DOI BibTeX RDF |
|
| 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. |
ASIACRYPT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan |
How Efficient Can Memory Checking Be?. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
An Optimally Fair Coin Toss. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev |
Public-Key Cryptosystems Resilient to Key Leakage. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan |
On the complexity of differentially private data release: efficient algorithms and hardness results. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
exponential mechanism, privacy, cryptography, traitor tracing, differential privacy |
| 1 | Moni Naor, Gil Segev, Udi Wieder |
History-Independent Cuckoo Hashing. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Adam Smith |
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Udi Wieder |
History-Independent Cuckoo Hashing. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gillat Kol, Moni Naor |
Cryptography and Game Theory: Designing Protocols for Exchanging Information. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Babaioff, Liad Blumrosen, Moni Naor, Michael Schapira |
Informational overhead of incentive compatibility. |
ACM Conference on Electronic Commerce |
2008 |
DBLP DOI BibTeX RDF |
ex-post implementation, mechanism design, communication complexity |
| 1 | Gillat Kol, Moni Naor |
Games for exchanging information. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
backward induction, cryptography, game theory, nash equilibrium, secret sharing, multiparty computation |
| 1 | Ilya Mironov, Moni Naor, Gil Segev |
Sketching in adversarial environments. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
data stream model., sketch model, massive data sets |
| 1 | Dan Boneh, Moni Naor |
Traitor tracing with constant size ciphertext. |
ACM Conference on Computer and Communications Security |
2008 |
DBLP DOI BibTeX RDF |
encryption, traitor tracing, fingerprinting codes |
| 1 | Tal Moran, Moni Naor, Gil Segev |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Udi Wieder |
Novel architectures for P2P applications: The continuous-discrete approach. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
routing, Peer-to-peer networks |
| 1 | Cynthia Dwork, Moni Naor |
Zaps and Their Applications. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum |
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. |
FUN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor (eds.) |
Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings |
EUROCRYPT |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Asaf Nussboim |
Implementing Huge Sparse Random Graphs. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor |
Split-ballot voting: everlasting privacy with distributed trust. |
ACM Conference on Computer and Communications Security |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Guy N. Rothblum |
The Complexity of Online Memory Checking. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor |
On the Compressibility of NP Instances and Cryptographic Applications. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Adam Smith |
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Guy N. Rothblum |
The Complexity of Online Memory Checking. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in Two-Party Secure Computation: A Computational View. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Benny Pinkas |
Oblivious Polynomial Evaluation. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor |
On Everlasting Security in the Hybrid Bounded Storage Model. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Guy N. Rothblum |
Learning to impersonate. |
ICML |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor |
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. |
EUROCRYPT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor |
Our Data, Ourselves: Privacy Via Distributed Noise Generation. |
EUROCRYPT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor |
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Adam Smith |
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor |
On the Compressibility of NP Instances and Cryptographic Applications. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor |
On fairness in the carpool problem. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Benny Pinkas |
Computationally Secure Oblivious Transfer. |
J. Cryptology |
2005 |
DBLP DOI BibTeX RDF |
Privacy preserving computation, Cryptography, Oblivious transfer, Secure function evaluation |
| 1 | Moni Naor, Udi Wieder |
Scalable and dynamic quorum systems. |
Distributed Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor |
Basing Cryptographic Protocols on Tamper-Evident Seals. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Nadav, Moni Naor |
The Dynamic And-Or Quorum System. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen |
On Robust Combiners for Oblivious Transfer and Other Primitives. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Asaf Nussboim, Eran Tromer |
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Hoeteck Wee |
Pebbling and Proofs of Work. |
CRYPTO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Guy N. Rothblum |
The Complexity of Online Memory Checking. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
Number-theoretic constructions of efficient pseudo-random functions. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
constant-depth threshold circuits, decision Diffie-Hellman, natural proofs, factoring, learning theory, Pseudo-random functions |
| 1 | Cynthia Dwork, Moni Naor, Amit Sahai |
Concurrent zero-knowledge. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
composition, cryptographic protocols, Zero knowledge |
| 1 | Moni Naor, Udi Wieder |
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. |
IPTPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Nadav, Moni Naor |
Fault-Tolerant Storage in a Dynamic Environment. |
DISC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold |
Immunizing Encryption Schemes from Decryption Errors. |
EUROCRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor (eds.) |
Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings |
TCC |
2004 |
DBLP BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in two-party secure computation: a computational view. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
oblivious tansfer, completeness, secure computation |
| 1 | Gurmeet Singh Manku, Moni Naor, Udi Wieder |
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
random structures, peer to peer networks, greedy routing |
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in Two-Party Secure Computation - A Computational View |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
Magic Functions. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
Fiat-Shamir methodology, interactive argument, magic function, selective decommitment, Digital signature, zero knowledge, interactive proof system |
| 1 | Dalit Naor, Moni Naor |
Protecting Cryptographic Keys: The Trace-and-Revoke Approach. |
IEEE Computer |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Fagin, Amnon Lotem, Moni Naor |
Optimal aggregation algorithms for middleware. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Udi Wieder |
A Simple Fault Tolerant Distributed Hash Table. |
IPTPS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Udi Wieder |
Novel architectures for P2P applications: the continuous-discrete approach. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
fault tolerance, distributed systems, peer-to-peer, hash tables |
| 1 | Moni Naor, Udi Wieder |
Scalable and dynamic quorum systems. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Andrew Goldberg, Moni Naor |
On Memory-Bound Functions for Fighting Spam. |
CRYPTO |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor |
On Cryptographic Assumptions and Challenges. |
CRYPTO |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor |
Moderately Hard Functions: From Complexity to Spam Fighting. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dalit Naor, Moni Naor, Jeffery Lotspiech |
Revocation and Tracing Schemes for Stateless Receivers |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor |
Zaps and Their Applications |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Yoad Lustig, Moni Naor |
On Chosen Ciphertext Security of Multiple Encryptions. |
IACR Cryptology ePrint Archive |
2002 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
Constructing Pseudo-Random Permutations with a Prescribed Structure. |
J. Cryptology |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Fagin, Amnon Lotem, Moni Naor |
Optimal Aggregation Algorithms for Middleware |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudorandom Functions and Factoring. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dahlia Malkhi, Moni Naor, David Ratajczak |
Viceroy: a scalable and dynamic emulation of the butterfly. |
PODC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor |
Deniable Ring Authentication. |
CRYPTO |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Kobbi Nissim |
Communication Complexity and Secure Function Evaluation |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-Random Functions and Factoring |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Sitvanit Ruah |
On the Decisional Complexity of Problems Over the Reals. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-Random Functions and Factoring. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Dalit Naor, Moni Naor, Jeffrey B. Lotspiech |
Revocation and Tracing Schemes for Stateless Receivers. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Kobbi Nissim |
Communication Complexity and Secure Function Evaluation. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")