Efficient and proactive threshold signcryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3650 LNCS, Issue , 2005, Pages 233-243

  Ma, Changshe ^a,b   Chen, Kefei ^a   Zheng, Dong ^a   Liu, Shengli ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b SOUTH CHINA NORMAL UNIVERSITY   (China)

Author keywords

Asynchronous network; Network security; Provable security; Threshold approach; Threshold signcryption

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; INTERNET; MOBILE TELECOMMUNICATION SYSTEMS; SECURITY OF DATA; THRESHOLD ELEMENTS;

ASYNCHRONOUS NETWORK; NETWORK SECURITY; PROVABLE SECURITY; THRESHOLD APPROACH; THRESHOLD SIGNCRYPTION;

CRYPTOGRAPHY;

EID: 33645991182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11556992_17     Document Type: Conference Paper

References (20)

1. A. Boldyreva, Efficient threshold signature, multisignature and blind signaure schemes based on the gap-Difiie-Hellman-group signature schemes, In PKC'2003, LNCS vol. 1567, pp. 31-46, 2003.
2. F. Bao and R.-H. Deng, A signcryption scheme with signature directly verifiable by public key, In Proceedings of PKC'98, LNCS 1998, pp. 55-59, 1998.
3. M. Bellare, P. Rogaway, Random oracles are practical: A paradigm for designing efficient protocols, Proc. of the 1st ACM Conference on Computer and Communications Security, pp. 62-73, 1993.
4. D. Boneh, B. Lymn and H. Shacham, Short signatures from the Weil pairing, Prodeedings of Asiacrypt 2001, Vol. 2248, LNCS, pp.514-532, 2001.
5. Y. Desmedt, Threshold cryptography, European Transactions on Telecommunications, 5(4), 1994.
6. Y. Desmedt and Y. Frankel, Threshold cryptosystems, Advances in Cryptology, Crypto'89, LNCS Vol. 435, 1989.
7. S. Goldwasser, S. Micali and R. Rivest, A digital signature scheme secure against adaptive chosen message attacks, SIAM J. Comput. 17, 2, pp. 281-308, 1988.
8. R. Housley, M. Ford, W. Polk, D.solo, Internet X.509 Public Key Infrastructure: certificate and CRL profile, http://www.ietf.org/rfc.html, January 1999.
9. A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung, Proactive secret sharing, or: How to cope with perpetual leakage, Advances in Cryptology, Crypto'95, LNCS Vol. 963, 1995.
10. A. Joux and K. Nguyen, Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups, In Journal of Cryptology, vol. 16,No. 4, pp. 239-247, 2003.
11. Hyung Koo, Hyun-Jeong Kim, Ik Rae Jeong, Dong-Hoon Lee, and Jongin Lim, Jointly unsigncryptable signcryption, WISA 2001, Vol.2, pp. 397-407, 2001.
12. B. Libert, J.-J. Quisquater, Efficient Signcryption with Key Privacy from Gap-Diffie-Hellman Groups, in PKC'2004, LNCS 2947, Springer-Verlag, pp. 187-200, 2004.
13. B. Libert, J.-J. Quisquater, Improved signcryption from q-Diffie-Hellman problems, SCN 2004, LNCS 3352, pp. 220-234, 2005.
14. J. Malone-Lee and W. Mao. Two birds one stone: signcryption using RSA. In Topics in Cryptology - proceedings of CT-RSA 2003, LNCS 2612, pp. 211-225. Springer, 2003.
15. National Institute of Standards ans Technology, JIST FIPS PUB 186, Digital signature standard, U.S. Department of Commerce (1994).
16. R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, PODC, 1991.
17. J.-B. Shin, K. Lee, and K. Shim, New DSA-verifiable signcryption schemes, In Proceedings of ICISC'02, LNCS 2587, pp. 35-47, 2000.
18. R. Steinfeld and Y. Zheng, A signcryption scheme based on integer factorization, In Proceedings of ISW00, LNCS 1975, pp. 308-322, 2000.
19. F. Zhang, R. Safavi-Naini, W. Susilo, An efficient signature scheme from bilinear pairings and its applications, PKC'04, LNCS 2947, pp. 277-290, 2004.
20. Y. Zheng, Digital signcryption or how to achieve cost (signature & encryption) ≤ cost(signature) + cost(encryption), In Advances in Cryptology - Crypto'97, LNCS 1294, pp. 165-179, 1997.