Probabilistic Termination and Composability of Cryptographic Protocols-Reference-Cited by-同舟云学术

Probabilistic Termination and Composability of Cryptographic Protocols

Published:2016 Issue: Volume: Page:240-269
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2016
language:
Short-container-title:

Author:

Cohen Ran,Coretti Sandro,Garay Juan,Zikas Vassilis

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-53015-3_9

Reference49 articles.

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

2. Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly-secure multiparty computation. Electron. Colloquium Comput. Complex. (ECCC) 18, 36 (2011)

3. 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

4. Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In: Probert, R.L., Lynch, N.A., Santoro, N. (eds.) 2nd ACM PODC, pp. 27–30. ACM Press, August 1983

5. Ben-O, M., El-Yaniv, R.: Resilient-optimal interactive consistency in constant time. Distrib. Comput. 16(4), 249–262 (2003)

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

1. Proof-of-Work-Based Consensus in Expected-Constant Time;Lecture Notes in Computer Science;2024

2. Completeness Theorems for Adaptively Secure Broadcast;Advances in Cryptology – CRYPTO 2023;2023

3. Optimal Synchronous Approximate Agreement with Asynchronous Fallback;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

4. Communication complexity of byzantine agreement, revisited;Distributed Computing;2022-07-17

5. On the Round Complexity of Randomized Byzantine Agreement;Journal of Cryptology;2022-03-04