상세 보기
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.
Citations
WEB OF SCIENCE
0Citations
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.
- 발행일
- 2012-11
- 유형
- Article
- 권
- 13
- 호
- 6
- 페이지
- 909 ~ 917
- 언어
- ENG
- 발행국가
- 대만
- 분량
- 9 페이지
- ISSN
- E 2079-4029
P 1607-9264