Skip to main content
Conference ProceedingsOPEN ACCESS

How to meet big data when private set intersection realizes constant communication complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9977 LNCS 445-454
DOI: 10.1007/978-3-319-50011-9_34
4Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents the first PSI protocol that achieves constant (O(1)) communication complexity with linear computation overhead and is fast even for the case of large input sets. The scheme is proven to be provably secure in the standard model against semi-honest parties. We combine somewhere statistically binding (SSB) hash function with indistinguishability obfuscation (iO) and Bloom filter to construct our PSI protocol.

Author supplied keywords

Cite

CITATION STYLE

APA

Debnath, S. K., & Dutta, R. (2016). How to meet big data when private set intersection realizes constant communication complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9977 LNCS, pp. 445–454). Springer Verlag. https://doi.org/10.1007/978-3-319-50011-9_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free