Author:
Canny John,Sorkin Stephen
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the First ACM Conference on Computer and Communications Security, pp. 62–73. ACM Press, New York (1993)
2. Blakley, G.R.: Safeguarding cryptographic keys 48, 313–317 (1979)
3. Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantipole: Practical asynchronous byzantine agreement using cryptography (extended abstract). In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 123–132. ACM Press, New York (2000)
4. Lecture Notes in Computer Science;R. Gennaro,1999
5. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Revisiting the distributed key generation for discrete-log based cryptosystems (2003)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Key Generation using Pseudorandom Number Generator;2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT);2023-07-06
2. 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
3. Practical Asynchronous Distributed Key Generation;2022 IEEE Symposium on Security and Privacy (SP);2022-05
4. ATSSIA: Asynchronous Truly-Threshold Schnorr Signing for Inconsistent Availability;Information Security and Cryptology – ICISC 2021;2022
5. From Fairness to Full Security in Multiparty Computation;Journal of Cryptology;2021-12-07