Efficient forward and provably secure ID-based signcryption scheme with public verifiability and public ciphertext authenticity

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

Volumn 2971, Issue , 2004, Pages 352-369

  Chow, Sherman S M ^a   Yiu, S M ^a   Hui, Lucas C K ^a   Chow, K P ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Cryptographic primitives; Elliptic curve cryptosystems; Firewalls; Forward security; Identity based signcryption; Network security; Provable security; Public ciphertext authenticity; Public key cryptosystems; Public verifiability; Semantical security

Indexed keywords

COMPUTER SYSTEM FIREWALLS; COMPUTER VIRUSES; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

CIPHERTEXTS; CRYPTOGRAPHIC PRIMITIVES; ELLIPTIC CURVE CRYPTOSYSTEMS; FORWARD SECURITY; IDENTITY-BASED SIGNCRYPTION; PROVABLE SECURITY; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC VERIFIABILITY; SEMANTICAL SECURITY;

CRYPTOGRAPHY;

EID: 35048854673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24691-6_26     Document Type: Article

References (22)

1. Jee Hea An, Yevgeniy Dodis, and Tal Rabin. On the Security of Joint Signature and Encryption. In Lars R. Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, International Conference, on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002, Proceedings, volume 2332 of Lecture Notes in Computer Science, pages 83-107. Springer-Verlag Heidelberg, 2002.
2. Feng Bao, Robert H. Deng, and Huafei Zhu. Variations of Diffie-Hellman Problem. In Dieter Qing, Dieter Gollmann, and Jianying Zhou, editors, Information and Communications Security, 5th International Conference, ICICS 2003, InnerMongolia 10-13 October, 2003, Proceedings, volume 2836 of Lecture Notes in Computer Science. Springer, 2003.
3. Paulo S.L.M. Barreto, Hae Yong Kim, Ben Lynn, and Michael Scott. Efficient Algorithms for Pairing-Based Cryptosystems. In Moti Yung, editor, Advances in Cryptology: Proceedings of CRYPTO 2002 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002 Proceedings, volume 2442 of Lecture Notes in Computer Science, pages 354-368. Springer-Verlag Heidelberg, 2002.
4. Mihir Bellare and Phillip Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In The First ACM Conference on Computer and Communications Security, pages 62-73, 1993.
5. Mihir Bellare and Bennet Yee. Forward-Security in Private-Key Cryptography. In Marc Joye, editor, Topics in Cryptology - CT-RSA2003, The Cryptographer's Track at RSA Conference 2003, volume 2612 of Lecture Notes in Computer Science, pages 1-18, 2003.
6. Dan Boneh and Matt Franklin. Identity-Based Encryption from the Weil Pairing. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 1923, 2001, Proceedings, volume 2139 of Lecture Notes in Computer Science, pages 213-229. Springer-Verlag Heidelberg, 2001.
7. Xavier Boyen. Multipurpose Identity-Based Signcryption : A Swiss Army Knife for Identity-Based Cryptography. In Dan Boneh, editor, 23rd International Conference on Advances in Cryptology - CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 382-398. Springer Verlag, 2003.
8. Jae Choon Cha and Jung Hee Cheon. An Identity-Based Signature from Gap Diffie-Hellman Groups. In Yvo Desmedt, editor, Public Key Cryptography - PKC 2003, Sixth International Workshop on Theory and Practice in Public Key Cryptography, Miami, FL, USA, January 6-8, 2003, Proceedings, volume 2567 of Lecture Notes in Computer Science. Springer, 2002.
9. Sherman S.M. Chow, Lucas C.K. Hui, S.M. Yiu and K.P. Chow. A Secure Modified ID-Based Undeniable Signature Scheme based on Han et al.'s Scheme against Zhang et al.'s Attacks. Cryptology ePrint Archive, Report 2003/262, 2003. Available at http://eprint.iacr.org.
10. Steven D. Galbraith, Keith Harrison, and David Soldera. Implementing the Tate Pairing. In Claus Fieker and David R. Kohel, editors, Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, Proceedings, volume 2369 of Lecture Notes in Computer Science, pages 324-337. Springer, 2002.
11. Chandana Gamage, Jussipekka Leiwo, and Yuliang Zheng. Encrypted Message Authentication by Firewalls. In Hideki Imai and Yuliang Zheng, editors, Public Key Cryptography: Second International Workshop on Practice and Theory in Public Key Cryptography, PKC 1999 Kamakura, Japan, March 1-3, 1999, volume 1560 of Lecture Notes in Computer Science, pages 69-81. Springer-Verlag, Heidelberg, 1999.
12. Florian Hess. Efficient Identity Based Signature Schemes based on Pairings. In K. Nyberg and H. Heys, editors, Selected Areas in Cryptography, 9th Annual International Workshop, SAC 2002, St. Johns, Newfoundland, Canada, August 15-16, 2002. Revised Papers, volume 2595 of Lecture Notes in Computer Science, pages 310-324. Springer-Verlag Heidelberg, February 2003.
13. Tetsuya Izu and Tsuyoshi Takagi. Efficient Computations of the Tate Pairing for the Large MOV Degrees. In Pil Joong Lee and Chae Hoon Lim, editors, Information Security and Cryptology - ICISC 2002, 5th International Conference, Seoul, Korea, November 28-29, 2002, Revised Papers, volume 2587 of Lecture Notes in Computer Science, pages 283-297. Springer-Verlag Heidelberg, 2003.
14. Ik Rae Jeong, Hee Yun Jeong, Hyun Sook Rhee, Dong Hoon Lee, and Jong In Lim. Provably Secure Encrypt-then-Sign Composition in Hybrid Signcryption. In Pil Joong Lee and Chae Hoon Lim, editors, Information Security and Cryptology ICISC 2002, 5th International Conference, Seoul, Korea, November 28-29, 2002, Revised Papers, volume 2587 of Lecture Notes in Computer Science, pages 16-34. Springer-Verlag Heidelberg, 2003.
15. Eunjeong Lee and YoungJu Choie. Implementation of Tate Pairing of Hyperelliptic Curves of Genus 2. In Jong In Lim and Dong Hoon Lee, editors, Information Security and Cryptology - ICISC 2003, 6th Annual International Conference on Information Security and Cryptology, Seoul, Korea, Nov 2003, Proceedings, Lecture Notes in Computer Science, Springer-Verlag, to appear.
16. Benoît Libert and Jean-Jacques Quisquater. New Identity Based Signcryption Schemes from Pairings. In IEEE Information Theory Workshop, pages 155-158, 2003. Full version available at http://eprint.iacr.org.
17. John Malone-Lee. Identity Based Signcryption. Cryptology ePrint Archive, Report 2002/098, 2002. Available at http://eprint.iacr.org.
18. Divya Nalla and K.C. Reddy. Signcryption scheme for Identity-Based Cryptosystems. Cryptology ePrint Archive, Report 2003/066, 2003. Available at http://eprint.iacr.org.
19. David Pointcheval and Jacques Stern. Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology: The Journal of the International Association for Cryptologic Research, 13(3):361-396, 2000.
20. Adi Shamir. Identity-Based Cryptosystems and Signature Schemes. In G.R. Blakley and David Chaum, editors, Advances in Cryptology, Proceedings of CRYPTO 1984, Santa Barbara, California, USA, August 19-22, 1984, Proceedings, volume 196 of Lecture Notes in Computer Science, pages 47-53. Springer-Verlag, 1985.
21. Jun-Bum Shin, Kwangsu Lee, and Kyungah Shim. New DSA-Verifiable Signcryption Schemes. In Pil Joong Lee and Chae Hoon Lim, editors, Information Security and Cryptology - ICISC 2002, 5th International Conference, Seoul, Korea, November 28-29, 2002, Revised Papers, volume 2587 of Lecture Notes in Computer Science, pages 35-47. Springer-Verlag Heidelberg, 2003.
22. Yuliang Zheng. Digital Signcryption or How to Achieve Cost (Signature & Encryption) ≪Cost(Signature) + Cost (Encryption). In Burton S. Kaliski Jr., editor, Advances in Cryptology: Proceedings of CRYPTO 1997 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, volume 1294 of Lecture Notes in Computer Science, pages 165-179. Springer-Verlag, 1997.