MPC with Synchronous Security and Asynchronous Responsiveness-Reference-Cited by-同舟云学术

MPC with Synchronous Security and Asynchronous Responsiveness

Published:2020 Issue: Volume: Page:92-119
ISSN:0302-9743
Container-title:Advances in Cryptology – ASIACRYPT 2020
language:
Short-container-title:

Author:

Liu-Zhang Chen-Da,Loss Julian,Maurer Ueli,Moran Tal,Tschudi Daniel

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-64840-4_4

Reference45 articles.

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

2. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd ACM STOC, pp. 503–513. ACM Press, May 1990

3. Beerliova-Trubiniova, Z., Hirt, M., Buus Nielsen, J.: Almost-asynchronous MPC with faulty minority. Cryptology ePrint Archive, Report 2008/416 (2008). http://eprint.iacr.org/2008/416

4. Beerliová-Trubíniová, Z., Hirt, M., Buus Nielsen, J.: On the theoretical gap between synchronous and asynchronous MPC protocols. In: PODC, Zurich, Switzerland (2010)

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

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

1. An optimisation for a two‐round good‐case latency protocol;IET Information Security;2023-07

2. Multidimensional Approximate Agreement with Asynchronous Fallback;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

3. Optimistic Fast Confirmation While Tolerating Malicious Majority in Blockchains;2023 IEEE Symposium on Security and Privacy (SP);2023-05

4. Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited;Theory of Cryptography;2023

5. Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback;Theory of Cryptography;2021