Constant-Round Multi-party Private Set Union Using Reversed Laurent Series-Reference-Cited by-同舟云学术

Constant-Round Multi-party Private Set Union Using Reversed Laurent Series

Published:2012 Issue: Volume: Page:398-412
ISSN:0302-9743
Container-title:Public Key Cryptography – PKC 2012
language:
Short-container-title:

Author:

Seo Jae Hong,Cheon Jung Hee,Katz Jonathan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-30057-8_24.pdf

Reference26 articles.

1. Lecture Notes in Computer Science;G. Ateniese,2011

2. Lecture Notes in Computer Science;D. Boneh,2005

3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 1–10. ACM Press (1988)

4. Lecture Notes in Computer Science;J. Brickell,2005

5. Camenisch, J.: Proof systems for general statements about discrete logarithms. Technical Report 260, Dept. of Computer Science, ETH Zurich (March 1997)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Secure Embedding Aggregation for Federated Representation Learning;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

2. Secure Computation of Two-party Multisets with Rational Numbers;J ELECTRON INF TECHN;2023

3. KVSAgg: Secure Aggregation of Distributed Key-Value Sets;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

4. Scalable Multi-party Private Set Union from Multi-query Secret-Shared Private Membership Test;Advances in Cryptology – ASIACRYPT 2023;2023

5. Nearly Optimal Protocols for Computing Multi-party Private Set Union;2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS);2022-06-10