Asymptotically Free Broadcast in Constant Expected Time via Packed VSS-Reference-Cited by-同舟云学术

Asymptotically Free Broadcast in Constant Expected Time via Packed VSS

Published:2022 Issue: Volume: Page:384-414
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Abraham Ittai,Asharov Gilad,Patil Shravani,Patra Arpita

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-22318-1_14

Reference51 articles.

1. Aws latency monitoring. https://www.cloudping.co/grid. Accessed February 2022

2. Lecture Notes in Computer Science;I Abraham,2021

3. Lecture Notes in Computer Science;I Abraham,2019

4. Abraham, I., Nayak, K.: Crusader agreement with $$\le 1/3$$ error is impossible for $$n \le 3f$$ if the adversary can simulate. Decentralized Thoughts, Blog Post (2021). https://tinyurl.com/decentralizedthougts. Accessed Sept 2021

5. Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: FOCS (2020)

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

1. Synchronous Distributed Key Generation without Broadcasts;IACR Communications in Cryptology;2024-07-08

2. Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS;Lecture Notes in Computer Science;2024

3. Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience;Lecture Notes in Computer Science;2024

4. Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience;Lecture Notes in Computer Science;2024

5. Communication-Efficient and Error-Free Gradecast with Optimal Resilience;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25