Efficient signcryption with key privacy from gap Diffie-Hellman Groups

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

Volumn 2947, Issue , 2004, Pages 187-200

  Libert, Benoît ^a   Quisquater, Jean Jacques ^a  

^a Microelectronics Laboratory   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES;

AUTHENTICATED ENCRYPTION; DIFFIE-HELLMAN ASSUMPTION; DIFFIE-HELLMAN PROBLEM; ENCRYPTION SCHEMES; GAP DIFFIE-HELLMAN GROUPS; PROVABLE SECURITY; RANDOM ORACLE MODEL; SIGNCRYPTION;

CRYPTOGRAPHY;

EID: 35048859269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24632-9_14     Document Type: Article

References (29)

1. J.-H. An, Y. Dodis and T. Rabin. On the Security of Joint Signature and Encryption. In Advances in Cryptology - Eurocrypt'02, LNCS 2332, pp. 83-107. Springer, 2002.
2. J. Baek, B. Lee and K. Kim. Secure Length-Saving ElGamal Encryption under the Computational Diffie-Hellman Assumption. In Proceedings of ACISP'00, LNCS 1841, pp. 49-58. Springer, 2000.
3. J. Baek, R. Steinfeld and Y. Zheng. Formal Proofs for the Security of Signcryption. In Proceedings of PKC'02, LNCS 2274, pp. 80-98. Springer, 2002.
4. J. Baek and Y. Zheng. Simple and Efficient Threshold Cryptosystem from the Gap Diffie-Hellman Group. Available at http://citeseer.nj.nec.com/567030. html.
5. 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.
6. M. Bellare, A. Boldyreva, A. Desai and D. Pointcheval. Key-Privacy in Public-Key Encryption. In Advances in Cryptology - Asiacrypt'01, LNCS 2248, pp. 566-582. Springer, 2001.
7. st ACM Conference on Computer and Communications Security, pp. 62-73, 1993.
8. D. Boneh and M. Franklin. Identity Based Encryption From the Weil Pairing. In Advances in Cryptology - Proceedings of Crypto'01, LNCS 2139, pp. 213-229. Springer, 2001.
9. D. Boneh, B. Lynn and H. Shacham. Short Signatures from the Weil Pairing. In Advances in Cryptology - Proceedings of Asiacrypt'01, LNCS 2248, pp. 514-532. Springer, 2001.
10. X. Boyen. Multipurpose Identity-Based Signcryption: A Swiss Army Knife for Identity-Based Cryptography. In Advances in Cryptology - Crypto'03, LNCS 2729, pp. 382-398. Springer, 2003.
11. Y. Dodis, M.-J. Freedman and S. Walfish. Parallel Signcryption with OAEP, PSSR and other Feistel Paddings. 2003. Available at http://eprint.iacr.org/ 2003/043/.
12. E. Fujisaki and T. Okamoto. Secure Integration of Asymmetric and Symmetric Encryption Schemes. In Advances in Cryptology - Crypto'99, LNCS 1666, pp. 537-554. Springer, 1999.
13. E. Fujisaki and T. Okamoto. How to Enhance the Security of Public-Key Encryption at Minimum Cost. In Proceedings of PKC'99, LNCS 1560, pp. 53-68. Springer, 1999.
14. S. Galbraith and W. Mao. Invisibility and Anonymity of Undeniable and Confirmer Signatures. In Topics in Cryptology - CT-RSA 2003, LNCS 2612, pp. 80-97. Springer, 2003.
15. C. Gamage, J. Leiwo and Y. Zheng. Encrypted Message Authentication by Firewalls. In Proceedings of PKC'98, LNCS 1560, pp. 69-81. Springer, 1998.
16. E.-J. Goh. and S. Jarecki. A Signature Scheme as Secure as the Diffie-Hellman Problem. In Advances in Cryptology - Eurocrypt'03, LNCS 2656, pp. 401-415. Springer, 2003.
17. I.-R. Jeong, H.-Y. Jeong, H.-S. Rhee, D.-H. Lee and I.-L. Jong. Provably Secure Encrypt-then-Sign Composition in Hybrid Signcryption. In Proceedings of ICISC'02, LNCS 2587, pp. 16-34. Springer, 2002.
18. A. Joux and K. Nguyen. Separating Decision Diffie-Hellman from Diffie-Hellman in Cryptographic Groups. In Journal of Cryptology, vol. 16-Number 4, pp. 239-247. Springer, 2003.
19. B. Libert and J.-J. Quisquater, Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups. Full paper, available on http://eprint.iacr.org.
20. J. Malone-Lee and W. Mao. Two Birds One Stone: Signcryption using RSA. In Topics in Cryptology - CT-RSA 2003, LNCS 2612, pp. 211-225. Springer, 2003.
21. T. Okamoto and D. Pointcheval. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In Proceedings of PKC'01, LNCS 1992. Springer, 2001.
22. J. Pieprzyk and D. Pointcheval. Parallel Authentication and Public-Key Encryption. In Proceedings of ACISP'03, LNCS 2727, pp. 383-401. Springer, 2003.
23. D. Pointcheval. Chosen-Ciphertext Security for any One-Way Cryptosystem. In Proceedings of PKC'00, LNCS 1751, pp. 129-146. Springer, 2000.
24. D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In Advances in Cryptology - Eurocrypt'96, LNCS 1992, pp. 387-398. Springer, 1996.
25. D. Pointcheval and J. Stern. Security Arguments for Digital Signatures and Blind Signatures. In Journal of Cryptology, vol. 13-Number 3, pp. 361-396. Springer, 2000.
26. J.-B. Shin, K. Lee and K. Shim. New DSA-verifiable Signcryption Schemes. In Proceedings of ICISC'02, LNCS 2587, pp. 35-47. Springer, 2002.
27. R. Steinfeld and Y. Zheng. A Signcryption Scheme Based on Integer Factorization. In Proceedings of ISW'00, LNCS 1975, pp. 308-322, Springer, 2000.
28. B.-H. Yum and P.-J. Lee. New Signcryption Schemes Based on KCDSA. In Proceedings of ICISC'01, LNCS 2288, pp. 305-317, Springer, 2001.
29. 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, Springer, 1997.