A generalization of Agrawal et al.'s protocol for n-party private set intersection over dynamic datasets

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

This work considers an n-party private set intersection (nPSI) problem and presents a corresponding practical protocol that is secure in the semi-honest model. Although the nPSI problem has already some solutions, they become inefficient in the real-life applications, especially when they run over multiple dynamic datasets whose elements are frequently updated. This motivates our work to circumvent this problem and obtain a practically meaningful result. To this end, we extend Agrawal et al.'s 2-party protocol to an nPSI protocol without compromising its practical efficiency. We provide the complexity to show that our construction efficiently runs over dynamic datasets.

키워드

Commutative encryption; Dynamic dataset; N-Party private set intersection
제목
A generalization of Agrawal et al.'s protocol for n-party private set intersection over dynamic datasets
저자
Kim, M.; Lee, H.T.; Cheon, J.H.
DOI
10.6138/JIT.2012.13.6.05
발행일
2012-11
유형
Article
저널명
Journal of Internet Technology
권
13
호
6
페이지
909 ~ 917