Amortized Complexity of Information-Theoretically Secure MPC Revisited-Reference-Cited by-同舟云学术

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Published:2018 Issue: Volume: Page:395-426
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cascudo Ignacio,Cramer Ronald,Xing Chaoping,Yuan Chen

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96878-0_14

Reference23 articles.

1. Bassa, A., Beelen, P., Garcia, A., Stichtenoth, H.: Towers of function fields over non-prime finite fields. Moscow Math. J. 15(1), 1–29 (2015)

2. Lecture Notes in Computer Science;D Beaver,1992

3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2–4 May 1988, pp. 1–10 (1988)

4. Lecture Notes in Computer Science;Z Beerliová-Trubíniová,2008

5. Lecture Notes in Computer Science;AR Block,2017

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

1. The Price of Active Security in Cryptographic Protocols;Journal of Cryptology;2024-07

2. Honest Majority Multiparty Computation over Rings with Constant Online Communication;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

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

4. Scalable Agreement Protocols with Optimal Optimistic Efficiency;Lecture Notes in Computer Science;2024

5. More Efficient Zero-Knowledge Protocols over $$\mathbb {Z}_{2^k}$$ via Galois Rings;Lecture Notes in Computer Science;2024