M
Moni Naor
Researcher at Weizmann Institute of Science
Publications - 348
Citations - 49941
Moni Naor is an academic researcher from Weizmann Institute of Science. The author has contributed to research in topics: Encryption & Cryptography. The author has an hindex of 102, co-authored 338 publications receiving 47090 citations. Previous affiliations of Moni Naor include IBM & Stanford University.
Papers
More filters
Proceedings ArticleDOI
Learning to impersonate
Moni Naor,Guy N. Rothblum +1 more
TL;DR: If one-way functions do not exist, then an efficient Eve can learn to impersonate any efficient Bob nearly as well as an unbounded Eve, and tightly bound the number of observations Eve makes in terms of the secret's entropy.
Journal ArticleDOI
On dice and coins: models of computation for random generation
TL;DR: To distinguish between random generation in bounded, as opposed to expected, polynomial time, a model of Probabalisic Turing Machine (PTM) with the ability to make random choices with any (small) rational bias is necessary.
Posted Content
Bloom Filters in Adversarial Environments
Moni Naor,Eylon Yogev +1 more
TL;DR: In this paper, the authors consider a data structure known as "Bloom filter" and prove a tight connection between Bloom filters in this model and cryptography, and show that Bloom filters exist if and only if one-way functions exist.
Journal ArticleDOI
Tight Bounds for Sliding Bloom Filters
Moni Naor,Eylon Yogev +1 more
TL;DR: This work considers a Sliding Bloom Filter: a data structure that, given a stream of elements, supports membership queries of the set of the last n elements (a sliding window), while allowing a small error probability and a slackness parameter.
Book ChapterDOI
Primary-Secondary-Resolver Membership Proof Systems
Moni Naor,Asaf Ziv +1 more
TL;DR: This work considers Primary-Secondary-Resolver Membership Proof Systems (PSR for short) and shows different constructions of that primitive, for constructing a secure Domain Name System (DNSSEC) that does not reveal any unnecessary information to its clients.