Fast Large-Scale Honest-Majority MPC for Malicious Adversaries-Reference-Cited by-同舟云学术

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

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

Author:

Chida Koji,Genkin Daniel,Hamada Koki,Ikarashi Dai,Kikuchi Ryo,Lindell Yehuda,Nof Ariel

Publisher

Springer International Publishing

Link

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

Reference26 articles.

1. Araki, T., Barak, A., Furukawa, J., Lichter, T., Lindell, Y., Nof, A., Ohara, K., Watzman, A., Weinstein, O.: Optimized honest-majority MPC for malicious adversaries - breaking the 1 billion-gate per second barrier. In: The IEEE S&P (2017)

2. Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: The 23rd ACM CCS, pp. 805–817 (2016)

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

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

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

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

1. Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules;Proceedings of the 19th International Conference on Availability, Reliability and Security;2024-07-30

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

3. Ratel: MPC-extensions for Smart Contracts;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

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

5. Don’t Eject the Impostor: Fast Three-Party Computation With a Known Cheater;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19