2 papers
cs.DB2002
Optimal Aggregation Algorithms for Middleware
Ron Fagin, Amnon Lotem, Moni Naor
Let D be a database of N objects where each object has m fields. The objects are given in m sorted lists (where the ith list is sorted according to the ith field). Our goal is to f…
cs.CR2001
Communication Complexity and Secure Function Evaluation
Moni Naor, Kobbi Nissim
We suggest two new methodologies for the design of efficient secure protocols, that differ with respect to their underlying computational models. In one methodology we utilize the…