Communication Locality in Secure Multi-party Computation-Reference-Cited by-同舟云学术

Communication Locality in Secure Multi-party Computation

Published:2013 Issue: Volume: Page:356-376
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Boyle Elette,Goldwasser Shafi,Tessaro Stefano

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-36594-2_21

Reference44 articles.

1. Collection of surveys on sublinear algorithms, http://people.csail.mit.edu/ronitt/sublinear.html

2. Lecture Notes in Computer Science;B. Adida,2007

3. Lecture Notes in Computer Science;G. Asharov,2012

4. Asharov, G., Lindell, Y.: A full proof of the bgw protocol for perfectly-secure multiparty computation. IACR Cryptology ePrint Archive, 2011:136 (2011)

5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1–10 (1988)

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

1. On the Communication Complexity of Secure Multi-Party Computation With Aborts;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Optimal Load-Balanced Scalable Distributed Agreement;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Asymptotically Optimal Message Dissemination with Applications to Blockchains;Lecture Notes in Computer Science;2024

4. MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably;Lecture Notes in Computer Science;2024

5. Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party;Journal of Cryptology;2023-10-27