Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees-Reference-Cited by-同舟云学术

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Published:2022-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Appan Ananya¹,Chandramouli Anirudh¹,Choudhury Ashish¹

Affiliation:

1. International Institute of Information Technology, Bangalore, Bangalore, India

Funder

Ministry of Electronics and Information technology

Electronics, IT & BT Government of Karnataka

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519270.3538417

Reference39 articles.

1. 2019. Lecture 10: Consensus. https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer19/tkds/Lec10.pdf. 2019. Lecture 10: Consensus. https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer19/tkds/Lec10.pdf.

2. I. Abraham , G. Asharov , and A. Yanai . 2021 . Efficient Perfectly Secure Computation with Optimal Resilience. In TCC (Lecture Notes in Computer Science) , Vol. 13043 . Springer, 66--96. I. Abraham, G. Asharov, and A. Yanai. 2021. Efficient Perfectly Secure Computation with Optimal Resilience. In TCC (Lecture Notes in Computer Science), Vol. 13043. Springer, 66--96.

3. I. Abraham D. Dolev and J. Y. Halpern. 2008. An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405--414. I. Abraham D. Dolev and J. Y. Halpern. 2008. An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405--414.

4. I. Abraham , D. Malkhi , K. Nayak , L. Ren , and M. Yin . 2020 . Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In IEEE Symposium on Security and Privacy. IEEE, 106--118 . I. Abraham, D. Malkhi, K. Nayak, L. Ren, and M. Yin. 2020. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In IEEE Symposium on Security and Privacy. IEEE, 106--118.

5. A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation

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

1. Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience;Theoretical Computer Science;2024-05

2. Network-Agnostic Multi-party Computation Revisited (Extended Abstract);Lecture Notes in Computer Science;2024

3. Closing the Efficiency Gap Between Synchronous and Network-Agnostic Consensus;Lecture Notes in Computer Science;2024

4. Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees;Financial Cryptography and Data Security;2023-12-01

5. Perfectly-Secure Synchronous MPC With Asynchronous Fallback Guarantees;IEEE Transactions on Information Theory;2023-08