Learn More
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. This problem has many applications for online collaboration. We present protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments.(More)
In this paper we address the issue of privacy preserving data mining. Specifically, we consider a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information. Our work is motivated by the need both to protect privileged information and to(More)
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 which is closely related to noisy polynomial re construction. A direct corollary of the l-out-of-N OT protccol is an(More)
<b>1 Introduction</b><br> Oblivious Transfer (OT) protocols allow one party, the sender,to transmit part of its inputs to another party, the chooser, in amanner that protects both of them: the sender is assured that thechooser does not receive more information than it is entitled,while the chooser is assured that the sender does not learn whichpart of the(More)
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptography, enabling a set of untrusting parties to compute any function of their private inputs while revealing nothing but the result of the function. In a sense, FairplayMP lets the parties run a(More)
Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out relevant security(More)
We show an efficient secure two-party protocol, based on Yao’s construction, which provides security against malicious adversaries. Yao’s original protocol is only secure in the presence of semi-honest adversaries, and can be transformed into a protocol that achieves security against malicious adversaries by applying the compiler of Goldreich, Micali, and(More)
Our goal is to design encryption schemes for mass distribution of data , which enable to (1) deter users from leaking their personal keys, (2) trace the identities of users whose keys were used to construct illegal decryption devices, and (3) revoke these keys as to render the devices dysfunctional. We start by designing an efficient revocation scheme,(More)
Cloud storage systems are becoming increasingly popular. A promising technology that keeps their cost down is <i>deduplication</i>, which stores only a single copy of repeating data. <i>Client-side deduplication</i> attempts to identify deduplication opportunities already at the client and save the bandwidth of uploading copies of existing files to the(More)