.png){kind=icon}
.png){kind=icon}
Return
A general and lightweight method for private set intersection computation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2025.110893.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given two or more sets with elements that are in plain text, it is straightforward to compute the intersection. If the elements are encrypted, then it becomes non-trivial. In this paper, we formally define the computational problem for private set intersection (PSI), and its corresponding security. We propose a general method for computing PSI with only semantics of encryption. Our method is lightweight so as to be feasible for sets with a large scale elements. We extensively analyze the security and performance to justify that our method can protect the privacy yet maintain the feasibility.
Keywords:
Private set intersection
Lightweight
Privacy protection
Feasibility
Journal
C
IF:
4.9
Papers:
90
Citations:
0