Welcome to the InfoSci Platform
Provably Secure Private Set Intersection With Constant Communication Complexity

Provably Secure Private Set Intersection With Constant Communication Complexity

Sumit Kumar Debnath
Copyright: © 2019 |Volume: 9 |Issue: 2 |Pages: 26
ISSN: 1947-3435|EISSN: 1947-3443|EISBN13: 9781522566892|DOI: 10.4018/IJCWT.2019040104
Cite Article Cite Article

MLA

Debnath, Sumit Kumar. "Provably Secure Private Set Intersection With Constant Communication Complexity." IJCWT vol.9, no.2 2019: pp.39-64. http://doi.org/10.4018/IJCWT.2019040104

APA

Debnath, S. K. (2019). Provably Secure Private Set Intersection With Constant Communication Complexity. International Journal of Cyber Warfare and Terrorism (IJCWT), 9(2), 39-64. http://doi.org/10.4018/IJCWT.2019040104

Chicago

Debnath, Sumit Kumar. "Provably Secure Private Set Intersection With Constant Communication Complexity," International Journal of Cyber Warfare and Terrorism (IJCWT) 9, no.2: 39-64. http://doi.org/10.4018/IJCWT.2019040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Electronic information is increasingly shared among unreliable entities. In this context, one interesting problem involves two parties that secretly want to determine an intersection of their respective private data sets while none of them wish to disclose the whole set to the other. One can adopt a Private Set Intersection (PSI) protocol to address this problem preserving the associated security and privacy issues. In this article, the authors present the first PSI protocol that incurs constant (p(k)) communication complexity with linear computation overhead and is fast even for the case of large input sets, where p(k) is a polynomial in security parameter k. Security of this scheme is proven in the standard model against semi-honest entities. The authors combine somewhere statistically binding (SSB) hash function with indistinguishability obfuscation (iO) and space-efficient probabilistic data structure Bloom filter to design the scheme.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.