Abstract
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
Author supplied keywords
Cite
CITATION STYLE
Sathya Narayanan, G., Aishwarya, T., Agrawal, A., Patra, A., Choudhary, A., & Pandu Rangan, C. (2009). Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5888 LNCS, pp. 21–40). https://doi.org/10.1007/978-3-642-10433-6_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
