Fast and proven secure blind identity-based signcryption from pairings

Lecture Notes in Computer Science

Volumn 3376, Issue , 2005, Pages 305-322

  Yuen, Tsz Hon ^a   Wei, Victor K ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA; THEOREM PROVING;

BLIND IDENTITY-BASED SIGNCRYPTION (BIBSC); RANDOM ORACLE MODEL; SECURITY THEOREM;

CRYPTOGRAPHY;

EID: 24144434019     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30574-3_21     Document Type: Conference Paper

References (27)

1. J.H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Proc. CRYPTO 2002, pages 83-107. Springer-Verlag, 2002. Lecture Notes in Computer Science No. 2332.
2. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The one-more-RSA-inversion problem and the security of Chaum's blind signature scheme. J. of Cryptology, pages 185-215, 2003.
3. A. Boldyreva. Efficient threshold signature, multisignature, and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme. In PKC'03, pages 31-46. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 567.
4. D. Boneh and M. Franklin. Identity-based encryption from the weil paring. In Proc. CRYPTO 2001, pages 213-229. Springer-Verlag, 2001. Lecture Notes in Computer Science No. 2139.
5. X. Boyen. Multipurpose identity-based signcryption: A swiss army knife for identity-based cryptography. In Proc. CRYPTO 2003, pages 382-398. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 2729.
6. J.C. Cha and J.H. Cheon. An identity-based signature from gap diffie-hellman groups. In Practice and Theory in Public Key Cryptography - PKC'2003, pages 18-30. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 2567.
7. D. Chaum. Blind signatures for untraceable payments. In Proc. CRYPTO 82, pages 199-203. NY, 1983. Plenum.
8. L. Chen and J. Malone-Lee. Improved identity-based signcryption. Cryptology ePrint Archive, Report 2004/114, 2004. http://eprint.iacr.org/.
9. S. Chow, S.M. Yiu, L. Hui, and K.P. Chow. Efficient forward and provably secure ID-based signcryption scheme with public verifiability and public ciphertext authenticity. In ICISC 2003, pages 352-369. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 2971.
10. C. Cocks. Non-interactive public-key cryptography. In Cryptography and Coding, pages 360-363. Springer-Verlag, 2001. Lecture Notes in Computer Science No. 2260.
11. K.C. Reddy D. Nalla. Signcryption scheme for identity-based cryptosystems. Cryptology ePrint Archive, Report 2003/066, 2003. http://eprint.iacr.org/.
12. Y. Desmedt and J. Quisquater. Public-key systems based on the difficulty of tampering. In Proc. CRYPTO 86, pages 111-117. Springer-Verlag, 1986. Lecture Notes in Computer Science No. 263.
13. B. Libert and J.-J. Quisquater. New identity based signcryption schemes from pairings. IEEE Information Theory Workshop, Paris (France), 2003.
14. B. Libert and J.-J. Quisquater. The exact security of an identity based signature and its applications. Cryptology ePrint Archive, Report 2004/102, 2004. http://eprint.iacr.org/.
15. J. Malone-Lee. Identity-based signcryption. Cryptology ePrint Archive, Report 2002/098, 2002. http://eprint.iacr.org/.
16. U. Maurer and Y. Yacobi. Non-interactive public-key cryptography. In Proc. CRYPTO 91, pages 498-507. Springer-Verlag, 1991. Lecture Notes in Computer Science No. 547.
17. N. McCullagh and P. S. L. M. Barreto. Efficient and forward-secure identity-based signcryption. Cryptology ePrint Archive, Report 2004/117, 2004. http://eprint.iacr.org/.
18. V.I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes 55, pages 165-172, 1994.
19. C. P. Schnorr. Practical security in public-key cryptography. In Proc. ICISC. Springer, 2001. Lecture Notes in Computer Science.
20. C. P. Schnorr. Security of blind discrete log signatures against interactive attacks. In Proc. ICISC, pages 1-12. Springer-Verlag, 2001. Lecture Notes in Computer Science No. 2229.
21. A. Shamir. Identity-based cryptosystems and signature schemes. In Proc. CRYPTO 84, pages 47-53. Springer-Verlag, 1984. Lecture Notes in Computer Science No. 196.
22. V. Shoup. Lower bounds for discrete logarithms and related problems. In Proc. EUROCRYPT 97, pages 256-266. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1233.
23. S. Tsuji and T. Itoh. An ID-based cryptosystem based on the discrete logarithm problem. IEEE Journal on Selected Areas in Communication, 7(4):467-473, 1989.
24. F. Zhang and K. Kim. ID-Based blind signature and ring signature from pairings. In Proc. ASIACRYPT 2002, pages 533-547. Springer-Verlag, 2002. Lecture Notes in Computer Science No. 2501.
25. F. Zhang and K. Kim. Efficient ID-based blind signature and proxy signature from bilinear pairings. In Proc. ACISP'03, pages 312-323. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 2727.
26. F. Zhang, R. Safavi-Naini, and W. Susilo. Efficient verifiably encrypted signature and partially blind signature from bilinear pairings. In Proc. INDOCRYPT03, pages 191-204. Springer-Verlag, 2003. Lecture Notes in Computer Science No. 2904.
27. Y. Zheng. Digital signcryption or how to achieve cost (signature & encryption) ≪ cost (signature) + cost (encryption). In Proc. CRYPTO 97, pages 165-179. Springer-Verlag, 1997. Lecture Notes in Computer Science No. 1294.