Moni Naor
According to our database^{1},
Moni Naor
authored at least 202 papers
between 1987 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at id.loc.gov

at isni.org

at dl.acm.org
On csauthors.net:
Bibliography
2020
ACM Trans. Priv. Secur., 2020
IACR Cryptol. ePrint Arch., 2020
Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users.
Proceedings of the 1st Symposium on Foundations of Responsible Computing, 2020
Proceedings of the Conference on Learning Theory, 2020
2019
ACM Trans. Algorithms, 2019
J. Cryptology, 2019
WhiteBox vs. BlackBox Complexity of Search Problems: Ramsey and Graph Property Testing.
J. ACM, 2019
OutofBand Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Electronic Colloquium on Computational Complexity (ECCC), 2019
2018
How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior.
IACR Cryptol. ePrint Arch., 2018
Electronic Colloquium on Computational Complexity (ECCC), 2018
2017
J. Cryptology, 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
2016
Theory Comput. Syst., 2016
J. Cryptology, 2016
NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses.
IACR Cryptol. ePrint Arch., 2016
Searchable Symmetric Encryption: Optimal Locality in Linear Space via TwoDimensional Balanced Allocations.
IACR Cryptol. ePrint Arch., 2016
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptol. ePrint Arch., 2016
Electronic Colloquium on Computational Complexity (ECCC), 2016
Electronic Colloquium on Computational Complexity (ECCC), 2016
Spooky Interaction and its Discontents: Compilers for Succinct TwoMessage Argument Systems.
Electronic Colloquium on Computational Complexity (ECCC), 2016
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.
Proceedings of the Advances in Cryptology  CRYPTO 2016, 2016
2015
IACR Cryptol. ePrint Arch., 2015
Electronic Colloquium on Computational Complexity (ECCC), 2015
Algorithmica, 2015
Proceedings of the Advances in Cryptology  ASIACRYPT 2015  21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015
2014
J. ACM, 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Proceedings of the Advances in Cryptology  CRYPTO 2014, 2014
2013
Electronic Colloquium on Computational Complexity (ECCC), 2013
Proceedings of the Algorithms and Computation  24th International Symposium, 2013
2012
IACR Cryptol. ePrint Arch., 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
SIAM J. Comput., 2011
2010
ACM Trans. Inf. Syst. Secur., 2010
Theor. Comput. Sci., 2010
SIAM J. Comput., 2010
On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy.
J. Priv. Confidentiality, 2010
Int. J. Inf. Sec., 2010
XRDS, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the Innovations in Computer Science, 2010
Backyard Cuckoo Hashing: Constant WorstCase Operations with a Succinct Representation.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
Proceedings of the 10th ACM Workshop on Digital Rights Management, 2010
2009
Deterministic HistoryIndependent Strategies for Storing Information on WriteOnce Memories.
Theory Comput., 2009
Cryptographic and Physical ZeroKnowledge Proof Systems for Solutions of Sudoku Puzzles.
Theory Comput. Syst., 2009
J. ACM, 2009
IACR Cryptol. ePrint Arch., 2009
IACR Cryptol. ePrint Arch., 2009
Algorithmica, 2009
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009
On the complexity of differentially private data release: efficient algorithms and hardness results.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
Deamortized Cuckoo Hashing: Provable WorstCase Performance and Experimental Results.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
2008
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
IEEE Trans. Inf. Theory, 2008
IACR Cryptol. ePrint Arch., 2008
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC2008), 2008
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008
2007
ACM Trans. Algorithms, 2007
Proceedings of the Approximation, 2007
2006
SIAM J. Comput., 2006
J. Cryptology, 2006
Electronic Colloquium on Computational Complexity (ECCC), 2006
Electronic Colloquium on Computational Complexity (ECCC), 2006
Proceedings of the Machine Learning, 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Proceedings of the Advances in Cryptology  EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006
Proceedings of the Advances in Cryptology  EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006
Proceedings of the Advances in Cryptology, 2006
2005
J. Cryptology, 2005
J. Algorithms, 2005
Distributed Comput., 2005
Proceedings of the Distributed Computing, 19th International Conference, 2005
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the Advances in Cryptology, 2005
Proceedings of the Advances in Cryptology, 2005
2004
J. ACM, 2004
J. ACM, 2004
Proceedings of the Distributed Computing, 18th International Conference, 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the PeertoPeer Systems III, Third International Workshop, 2004
Proceedings of the Advances in Cryptology, 2004
2003
SIAM Review, 2003
J. Comput. Syst. Sci., 2003
J. ACM, 2003
IEEE Computer, 2003
Proceedings of the PeertoPeer Systems II, Second International Workshop, 2003
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003
Proceedings of the Advances in Cryptology, 2003
Proceedings of the Advances in Cryptology, 2003
2002
SIAM J. Comput., 2002
J. Cryptology, 2002
IACR Cryptol. ePrint Arch., 2002
Electronic Colloquium on Computational Complexity (ECCC), 2002
Electronic Colloquium on Computational Complexity (ECCC), 2002
Proceedings of the TwentyFirst Annual ACM Symposium on Principles of Distributed Computing, 2002
Proceedings of the Advances in Cryptology, 2002
2001
Inf. Comput., 2001
IACR Cryptol. ePrint Arch., 2001
Electronic Colloquium on Computational Complexity (ECCC), 2001
Electronic Colloquium on Computational Complexity (ECCC), 2001
Proceedings of the Tenth International World Wide Web Conference, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
2000
IEEE Trans. Inf. Theory, 2000
IEEE J. Sel. Areas Commun., 2000
Inf. Process. Lett., 2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the Advances in Cryptology, 2000
Proceedings of the Advances in Cryptology, 2000
1999
SIAM J. Comput., 1999
J. Cryptology, 1999
Synthesizers and Their Application to the Parallel Construction of PseudoRandom Functions.
J. Comput. Syst. Sci., 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
Proceedings of the First ACM Conference on Electronic Commerce (EC99), 1999
Proceedings of the Proceedings IEEE INFOCOM '99, 1999
Proceedings of the Advances in Cryptology, 1999
Proceedings of the Advances in Cryptology, 1999
1998
IEEE Trans. Parallel Distrib. Syst., 1998
SIAM J. Comput., 1998
J. Cryptology, 1998
J. Cryptology, 1998
J. Algorithms, 1998
IACR Cryptol. ePrint Arch., 1998
Comput. Networks, 1998
Proceedings of the Advances in Cryptology  EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998
From Unpredictability to Indistinguishability: A Simple Construction of PseudoRandom Functions from MACs (Extended Abstract).
Proceedings of the Advances in Cryptology, 1998
Proceedings of the Advances in Cryptology, 1998
1997
IACR Cryptol. ePrint Arch., 1997
Electronic Colloquium on Computational Complexity (ECCC), 1997
On the Construction of PseudoRandom Permutations: LubyRackoff Revisited (Extended Abstract).
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
J. Cryptology, 1996
IACR Cryptol. ePrint Arch., 1996
IACR Cryptol. ePrint Arch., 1996
Commun. ACM, 1996
Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions.
Algorithmica, 1996
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
Digital Signets: SelfEnforcing Protection of Digital Information (Preliminary Version).
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
1995
SIAM J. Discret. Math., 1995
SIAM J. Comput., 1995
SIAM J. Comput., 1995
SIAM J. Comput., 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Synthesizers and Their Application to the Parallel Construction of PsuedoRandom Functions.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
J. Comput. Syst. Sci., 1994
Algorithmica, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
Proceedings of the Advances in Cryptology, 1994
Proceedings of the Advances in Cryptology, 1994
1993
Inf. Comput., June, 1993
IEEE Trans. Inf. Theory, 1993
SIAM J. Comput., 1993
SIAM J. Comput., 1993
SIAM J. Comput., 1993
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993
Proceedings of the Advances in Cryptology, 1993
Proceedings of the Advances in Cryptology, 1993
1992
Construction of asymptotically good lowrate errorcorrecting codes through pseudorandom graphs.
IEEE Trans. Inf. Theory, 1992
SIAM J. Discret. Math., 1992
On the Time and Space Complexity of Computation Using WriteOnce Memory Or Is Pen Really Much Worse Than Pencil?
Math. Syst. Theory, 1992
J. ACM, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
Perfect ZeroKnowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract).
Proceedings of the Advances in Cryptology, 1992
Proceedings of the Advances in Cryptology, 1992
Proceedings of the Advances in Cryptology, 1992
1991
SIAM J. Discret. Math., 1991
J. Cryptology, 1991
J. Comput. Syst. Sci., 1991
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
IEEE Trans. Inf. Theory, 1990
Distributed Comput., 1990
Discret. Appl. Math., 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
SIAM J. Comput., 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Proceedings of the Advances in Cryptology, 1989
1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
Proceedings of the Advances in Cryptology, 1988
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988
1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987