Paper 2024/1974
Efficient and Practical Multi-party Private Set Intersection Cardinality Protocol
Abstract
We present an efficient and simple multi-party private set intersection cardinality (PSI-CA) protocol that allows several parties to learn the intersection size of their private sets without revealing any other information. Our protocol is highly efficient because it only utilizes the Oblivious Key-Value Store and zero-sharing techniques, without incorporating components such as OPPRF (Oblivious Programmable Pseudorandom Function) which is the main building block of multi-party PSI-CA protocol by Gao et al. (PoPETs 2024). Our protocol exhibits better communication and computational overhead than the state-of-the-art.
To compute the intersection between 16 parties with a set size of
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. Trustcom 2024
- Keywords
- PSI-CAmpcOKVS
- Contact author(s)
-
msz22 @ mails tsinghua edu cn
wangxd22 @ mails tsinghua edu cn
lzjluzijie @ gmail com
lbei @ bimsa cn - History
- 2024-12-12: approved
- 2024-12-06: received
- See all versions
- Short URL
- https://ia.cr/2024/1974
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2024/1974, author = {Shengzhe Meng and Xiaodong Wang and Zijie Lu and Bei Liang}, title = {Efficient and Practical Multi-party Private Set Intersection Cardinality Protocol}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1974}, year = {2024}, url = {https://eprint.iacr.org/2024/1974} }