Weizmann Institute of Science
Ronald Fagin, Amnon Lotem, Moni Naor
Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001 – PODS
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted ...
Cynthia Dwork, S. Ravi Kumar, Moni Naor, D. Sivakumar
We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking functions, selecting documents based on multiple criteria, and ...
Dahlia Malkhi, Moni Naor, David Ratajczak
PODC 2002: Monterey, 2002 – PODC
We propose a family of constant-degree routing networks of logarithmic diameter, with the additional property that the addition or removal of a node to the network requires no global coordination, only a constant number of linkage changes in ...
Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 1989 – STOC
We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x. We prove constructively that universal one-way hash ...
Ronald Fagin, Amnon Lotem, Moni Naor
Journal of Computer and System Sciences, vol. 66,no. 4,2003 – JCSS
Assume that each object in a database has m grades, or scores, one for each of m attributes. ForexamzUan object can ave a color grade, t at tells ow red it is, and a s ape grade, t at tells ow round it is. For eac attribute, t ere is a sorted list, ...
SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms, 2003 – SPAA
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to processors. We demonstrate the power of these design rules by suggesting two new architectures, one for DHT ...
Moni Naor, Benny Pinkas, Reuban Sumner
1st ACM conference on Electronic commerce, 1999 – EC
We suggest an architecture for executing protocols for auctions and, more generally, mechanism design. Our goal is to preserve the privacy of the inputs of the participants (so that no nonessential information about them is divulged, even a ...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004 – STOC
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e. g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world percolation networks. In each of these ...
Cynthia Dwork, Moni Naor, Amit Sahai
Abw.xt Concurrent executions of a zero-knowledge protocol by a ainSle prover (with one or more verifiers) may leak information and may not be zero-knowledge in toto; for example, in the case of zero-knowledge interactive proofs or arguments, the ...
We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d â€˜Oblivious Poly&nial Evaluation. The oblivious polynomial evaluation protocol is based on a new intractability assumption ...