Anti-collusion multi-party private set union protocol in low-bandwidth scenarios
Aiming at the problems of the existing multi-party private set union (MPSU) protocols, such as a large number of interaction rounds and excessive communication overhead, which prevented them from being effectively applied in low-bandwidth scenarios, an oblivious matching permutation method based on...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2025-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2025020/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Aiming at the problems of the existing multi-party private set union (MPSU) protocols, such as a large number of interaction rounds and excessive communication overhead, which prevented them from being effectively applied in low-bandwidth scenarios, an oblivious matching permutation method based on oblivious key-value store and threshold homomorphic encryption technologies was designed, and a multi-party private set union protocol under a semi-honest model was proposed through this method. This protocol allowed <inline-formula><alternatives><math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3"><mi>N</mi></math><graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/6B686B1A-6D2D-4f0e-B9C4-39328275CA3D-M003.jpg"><?fx-imagestate width="2.53999996" height="2.28600001"?></graphic><graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/6B686B1A-6D2D-4f0e-B9C4-39328275CA3D-M003c.jpg"><?fx-imagestate width="2.53999996" height="2.28600001"?></graphic></alternatives></inline-formula> participants to jointly calculate the union of all sets and would not leak any other information. It mainly has the advantages of a small number of communication rounds, the ability to resist the collusion of <inline-formula><alternatives><math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4"><mi>N</mi><mo>-</mo><mn mathvariant="normal">1</mn></math><graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/6B686B1A-6D2D-4f0e-B9C4-39328275CA3D-M004.jpg"><?fx-imagestate width="7.70466709" height="2.28600001"?></graphic><graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/6B686B1A-6D2D-4f0e-B9C4-39328275CA3D-M004c.jpg"><?fx-imagestate width="7.70466709" height="2.28600001"?></graphic></alternatives></inline-formula> participants, and low communication overhead. Its communication overhead is reduced by about 65% compared to the existing most advanced multi-party private set union. |
|---|---|
| ISSN: | 1000-436X |