Author:
Canetti Ran,Gennaro Rosario,Jarecki Stanisław,Krawczyk Hugo,Rabin Tal
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8 th ACM PODC, pages 201–209. ACM, 1989.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In Proc. 20 th STOC, pages 1–10. ACM, 1988.
3. Lect Notes Comput Sci;D. Beaver,1992
4. E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470.
5. R. Canetti. Security and composition of multiparty cryptographic protocols. Available at the Theory of Cryptography Library, http://theory.lcs.mit.edu/~tcryptol . 1998.
Cited by
75 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adaptively Secure (Aggregatable) PVSS and Application to Distributed Randomness Beacons;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
2. Collusion-Deterrent Threshold Information Escrow;2023 IEEE 36th Computer Security Foundations Symposium (CSF);2023-07
3. Practical Asynchronous Distributed Key Generation: Improved Efficiency, Weaker Assumption, and Standard Model;2023 53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN);2023-06
4. Network-Agnostic Security Comes (Almost) for Free in DKG and MPC;Advances in Cryptology – CRYPTO 2023;2023
5. Fully Adaptive Schnorr Threshold Signatures;Advances in Cryptology – CRYPTO 2023;2023