Mutual private set intersection with linear complexity
- Authors
- Kim, M.; Lee, H.T.; Cheon, J.H.
- Issue Date
- Aug-2012
- Keywords
- Mutual Private Set Intersection; Prime Representation
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.7115 LNCS, pp 219 - 231
- Pages
- 13
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 7115 LNCS
- Start Page
- 219
- End Page
- 231
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/64938
- DOI
- 10.1007/978-3-642-27890-7_18
- ISSN
- 0302-9743
1611-3349
- Abstract
- A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs. While in its unilateral version only the client can obtain the intersection, the mutual PSI protocol enables all players to get the desired result. In this work, we construct a mutual PSI protocol that is significantly more efficient than the state-of-the-art in the computation overhead. To the best of our knowledge, our construction is the first result with linear computational complexity in the semi-honest model. For that, we come up with an efficient data representation technique, called prime representation.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.