Mutual private set intersection with linear complexity

Citations

SCOPUS

15

초록

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.

키워드

Mutual Private Set Intersection; Prime Representation
제목
Mutual private set intersection with linear complexity
저자
Kim, M.; Lee, H.T.; Cheon, J.H.
DOI
10.1007/978-3-642-27890-7_18
발행일
2012-08
유형
Conference Paper
저널명
Lecture Notes in Computer Science
권
7115 LNCS
페이지
219 ~ 231