Many data mining algorithms use privacy preserving set intersection operations. Private set operations have considered semi-honest and malicious adversarial models in cryptographic settings. Protocols in semi-honest model, requiring light computations, provide weak security. Protocols in malicious model guarantee strong security at the price of expensive computations like homomorphic encryption...

Private set intersection is an important area of research and has been the focus of many works over the past decades. It describes the problem of finding an intersection between the input sets of at least two parties without revealing anything about the input sets apart from their intersection. In this paper, we present a new approach to compute the intersection between sets based on a primitiv...

In this paper, we study the problem of answering queries about private data that is spread across multiple different databases. For instance, a medical researcher may want to study a possible correlation between travel patterns and certain types of illnesses. The necessary information exists today – e.g., in airline reservation systems and hospital records – but it is maintained by two separate...

Sharing information to others is common nowadays, but the question is with whom to share. To address this problem, we propose the notion of secret transfer with access structure (STAS). STAS is a two-party computation protocol that enables the server to transfer a secret to a client who satisfies the prescribed access structure. In this paper, we focus on the case of STAS for threshold access s...

We define tropical Psi-classes on M 0,n (R 2 , d) and consider intersection products of Psi-classes and pull-backs of evaluations on this space. We show a certain WDVV equation which is sufficient to prove that tropical numbers of curves satisfying certain Psi-and evaluation conditions are equal to the corresponding classical numbers. We present an algorithm that generalizes Mikhalkin's lattice...

In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality of Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t < n/2 parties. To the best of our knowledge, the...

In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t < n/2 parties. To the best of our knowledge, these ...