Paper 2022/713
More Efficient (Reusable) Private Set Union
Abstract
We study the problem of private set union in the two-party setting, providing several new constructions. We consider the case where one party is designated to receive output. In the semi-honest setting, we provide a four-round protocol and two-round protocol, each with two variants. Our four-round protocol focusing on runtime out-performs the state-of-the-art in runtime for the majority of the medium bandwidth settings (
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Private Set UnionSecure Two-Party ComputationReusability
- Contact author(s)
-
gordon @ gmu edu
carmit hazay @ biu ac il
ple13 @ gmu edu
mliang5 @ gmu edu - History
- 2024-02-04: last of 2 revisions
- 2022-06-04: received
- See all versions
- Short URL
- https://ia.cr/2022/713
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/713, author = {Dov Gordon and Carmit Hazay and Phi Hung Le and Mingyu Liang}, title = {More Efficient (Reusable) Private Set Union}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/713}, year = {2022}, url = {https://eprint.iacr.org/2022/713} }