Efficient Constructions for Almost-Everywhere Secure Computation-Reference-Cited by-同舟云学术

Efficient Constructions for Almost-Everywhere Secure Computation

Published:2020 Issue: Volume: Page:159-183
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2020
language:
Short-container-title:

Author:

Jayanti Siddhartha,Raghuraman Srinivasan,Vyas Nikhil

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-45724-2_6

Reference22 articles.

1. Lecture Notes in Computer Science;B Barak,2005

2. 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)

3. Ben-Or, M., Ron, D.: Agreement in the presence of faults, on networks of bounded degree. Inf. Process. Lett. 57(6), 329–334 (1996)

4. Lecture Notes in Computer Science;P Berman,1989

5. Lecture Notes in Computer Science;P Berman,1991

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

1. Practical Provably Secure Flooding for Blockchains;Advances in Cryptology – ASIACRYPT 2022;2022

2. Reaching Efficient Byzantine Agreements in Bipartite Networks;IEEE Access;2022

3. Simulating Authenticated Broadcast in Networks of Bounded Degree;2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS);2021-12

4. Boosting Byzantine Protocols in Large Sparse Networks with High System Assumption Coverage;2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS);2021-12