Benny Pinkas

We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. Expand

In this paper we address the issue of privacy preserving data mining. Expand

This paper presents several significant improvements to oblivious transfer protocols of strings, and in particular:(i) Improving the efficiency of applications which many invocationsof oblivious transfer. (ii) Providing the first two-round OT protocol whose security analysis does not invoke the random oraclemodel. Expand

We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d ‘Oblivious Poly&nial Evaluation. Expand

We identify attacks that exploit client-side deduplication, allowing an attacker to gain access to arbitrary-size files of other users based on a very small hash signatures of these files. Expand

In this paper we introduce the concept of privacy preserving data mining. Expand

Multicast communication is becoming the basis for a growing number of applications. Expand

We suggest an architecture for executing protocols for auctions and, more generally, mechanism design by adding another party the auction issuer that generates the programs for computing the auctions but does not take an active part in the protocol. Expand

This paper introduces Fairplay [28], a full-fledged system that implements generic secure function evaluation (SFE). Expand

In this paper, we survey the basic paradigms and notions of secure mul- tiparty computation and discuss their relevance to the fleld of privacy-preserving data mining. Expand