Two classes of robust threshold key escrow schemes

Ruan Jian Xue Bao/Journal of Software

Volumn 14, Issue 6, 2003, Pages 1164-1171

  Cao, Zhen Fu ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

ElGamal cryptosystem; Escrow agent; Improved RSA cryptosystem; Key escrow; Monitor; Robustness; Threshold scheme

Indexed keywords

ALGORITHMS; COMMUNICATION; MONITORING; ROBUSTNESS (CONTROL SYSTEMS); THRESHOLD LOGIC;

ELGAMAL CRYPTOSYSTEMS; ESCROW AGENCIES; KEY ESCROW; SECRET SHADOWS;

CRYPTOGRAPHY;

EID: 0141719369     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Denning DE, Smid M. Key escrowing today. IEEE Communications Magazine, 1994, 32(9): 58-68.
2. Shamir A. Partial key escrow: A new approach to software key escrow. In: Proceedings of the Key Escrow Conference. Washington, 1995.
3. Lenstra AK, Winkler P, Yacobi Y. A key escrow system with warrant bound. In: Coppersmith D, ed. Proceedings of the Crypto'95. LNCS 963, Berlin: Springer-Vrelag, 1995. 197-207.
4. Micali S. Fair cryptosystems. Technique Report, MIT/LCS/TR-579.c, Cambridge: Massachusetts Institute of Technology, 1994.
5. Micali S, Ney R. A simple method for generating and sharing pseudo-random functions with application to clipper-like key escrow system. In: Coppersmith D, ed. Proceedings of the Crypto'95. LNCS 963, Berlin: Springer-Verlag, 1995. 184-196.
6. Yang Bo, Ma WP, Wang, YM. A new secret sharing threshold scheme and key escrow system. Acta Electronica Sinica, 1998, 26(10): 1-3 (in Chinese with English abstract).
7. Nechvatal J. A public-key-based key escrow system. Journal of Systems Software, 1996, 35(1): 73-83.
8. Denning DE. Description of key escrow system. 1997. http://www.cs.georgetown.edu/-denning/crypto/Appendix.html/.
9. Desmedt Y, Frankel Y. Threshold cryptosystems. In: Brassard G, ed. Proceedings of the Crypto'89. LNCS 435, Berlin: Springer-Verlag, 1990. 307-315.
10. Desmedt Y, Frankel Y. Shared generation of authenticators and signatures. In: Feigenbaum J, ed. Proceedings of the Crypto'91. LNCS 576, Berlin: Springer-Verlag, 1992. 457-469.
11. Santis AD, Desmedt Y, Frankel Y, Yung M. How to share a function securely. In: Proceedings of the 26th ACM Symp. on Theory of Computing. ACM Press, 1994. 522-533.
12. Gennaro R, Jarecki S, Krawczyk H, Rabin T. Robust arid efficient sharing of RSA functions. In: Koblitz N, ed. Proceedings of the Crypto'96. LNCS 1109, Berlin: Springer-Verlag, 1996. 157-172.
13. Cao ZF, A threshold key escrow scheme based on public key cryptosystem. Science in China (Series E), 2001, 44(4): 441-448 (in Chinese with English abstract).
14. Cao ZF, Li JG. A threshold key escrow scheme based on ElGamal cryptosystem. Chinese Journal of Computers, 2002, 25(4): 346-350 (in Chinese with English abstract).
15. Wang GL, Qing SH. Weaknesses of some threshold group signature schemes. Journal of Software, 2000, 11(10): 1326-1332 (in Chinese with English abstract).
16. Cerecedo M, Matsumoto T, Imai H. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Transactions on Fundamentals, 1993, E76-A(4): 532-545.
17. Frankel Y, Gemmell P, Yung M. Witness-based cryptographic program checking and robust function sharing. In: Proceedings of 28th the ACM Symposium on Theory of Computing. ACM Press, 1996. 499-508.
18. Gennaro R, Jarecki S, Krawczyk H, Rabin T. Robust threshold DSS signatures. In: Maurer U, ed. Advances in Cryptology-Eurocrypt'96. LNCS 1070, Springer-Verlag, 1996. 354-371.
19. Cao ZF. Public Key Cryptology. Harbin: Heilongjiang Education Press, 1993. 158-185 (in Chinese).
20. Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612-613.
21. Rivest RL, Shamir A, Adleman L. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 1978, 21(2): 120-126.
22. ElGamal T. A public-key cryptosystem and a signature scheme based on discrete logarithm. IEEE Transactions on Information Theory, 1985, 31(4): 469-472.