Formal proofs for the security of signcryption

Journal of Cryptology

Volumn 20, Issue 2, 2007, Pages 203-235

  Baek, Joonsang ^a   Steinfeld, Ron ^b   Zheng, Yuliang ^c  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b MACQUARIE UNIVERSITY   (Australia)

^c University of North Carolina at Charlotte   (United States)

Author keywords

Flexible signcryption unsigncryption oracle models; Gap Diffie Hellman problem; Gap discrete log problem; Signcryption

Indexed keywords

FLEXIBLE SIGNCRYPTION; GAP DIFFIE-HELLMAN PROBLEM; GAP DISCRETE LOG PROBLEM; SIGNCRYPTION; UNSIGNCRYPTION ORACLE MODELS;

COMPUTATIONAL MECHANICS; CRYPTOGRAPHY; MATHEMATICAL MODELS; MESSAGE PASSING; PROBLEM SOLVING;

SECURITY OF DATA;

EID: 33947512019     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-007-0211-0     Document Type: Article

References (36)

1. J. An, Y. Dodis and T. Rabin: On the Security of Joint Signature and Encryption, Advances in Cryptology - Proceedings of EUROCRYPT 2002, Vol. 2332 of LNCS, Springer-Verlag, Berlin, 2002, pages 83-107.
2. J. An, Y. Dodis and T. Rabin: On the Security of Joint Signature and Encryption, Report 2002/046, Cryptology ePrint Archive, 2002.
3. J. Baek, R. Steinfeld and Y. Zheng: Formal Proofs for the Security of Signcryption, Proceedings of Public Key Cryptography 2002 (PKC 2002), Vol. 2274 of LNCS, Springer-Verlag, Berlin, 2002, pages 80-98.
4. M. Bellare, A. Desai, E. Jokipii and P. Rogaway: A Concrete Security Treament of Symmetric Encryption, Proceedings of FOCS '97, IEEE Computer Society Press, Los Alamitos, CA, 1997, pages 394-403.
5. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway: Relations Among Notions of Security for Public-Key Encryption Schemes, Advances in Cryptology - Proceedings of CRYPTO '98, Vol. 1462 of LNCS, Springer-Verlag, Berlin, 1998, pages 26-45.
6. M. Bellare and C. Namprepre: Authenticated Enciyption: Relations Among Notions and Analysis of the Generic Composition Paradigm, Advances in Cryptology - Proceedings of ASIACRYPT 2000, Vol. 1976 of LNCS, Springer-Verlag, Berlin, 2000, pages 531-545.
7. M. Bellare and P. Rogaway: Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols, Proceedings of the First ACM Conference on Computer and Communications Security, 1993, pages 62-73.
8. M. Bellare and P. Rogaway: Optimal Asymmetric Encryption, Advances in Cryptology - Proceedings of Eurocrypt '94, Vol. 950 of LNCS, Springer-Verlag, Berlin, 1994, pages 92-111.
9. M. Bellare and P. Rogaway: The Game-Playing Technique, Report 2004/331, International Association for Cryptographic Research (IACR) ePrint Archive, 2004.
10. R. Cramer and V. Shoup: A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack, Advances in Cryptology - Proceedings of CRYPTO '98, Vol. 1462 of LNCS, Springer-Verlag, Berlin, 1998, pages 13-25.
11. R. Cramer and V. Shoup: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack, Report 2001/108, International Association for Cryptographic Research (IACR) ePrint Archive, 2001.
12. T. ElGamal: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, Vol. 31, 1985, pages 469-472.
13. A. Fiat and A. Shamir: How to Prove Yourself: Practical Solutions of Identification and Signature Problems, Proceedings of CRYPTO '86, Vol. 263 of LNCS, Springer-Verlag, Berlin, 1987, pages 186-194.
14. E. Fujisaki and T. Okamoto: How to Enhance the Security of Public-Key Encryption at Minimum Cost, Proceedings of Public Key Cryptography '99 (PKC '99), Vol. 1666 of LNCS, Springer-Verlag, Berlin, 1999, pages 53-68.
15. S. Goldwasser and S. Micali: Probabilistic Encryption, Journal of Computer and System Sciences, Vol. 28, 1984, pages 270-299.
16. S. Goldwasser, S. Micali and R. Rivest: A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks, SIAM Journal on Computing, Vol. 17, No. 2, 1988, pages 281-308.
17. C. Jutla: Encryption Modes with Almost Free Message Integrity, Advances in Cryptology - Proceedings of EUROCRYPT 2001, Vol. 2045 of LNCS, Springer-Verlag, Berlin, 2001, pages 529-544.
18. H. Krawczyk: The Order of Encryption and Authentication for Protecting Communications (Or: How Secure Is SSL?), Advances in Cryptology - Proceedings of CRYPTO 2001, Vol. 2139 of LNCS, Springer-Verlag, Berlin, 2001, pages 310-331.
19. M. Naor and M. Yung: Public-Key Cryptosystems Secure against Chosen Ciphertext Attacks, Proceedings of the 22nd ACM Sysmposium on Theory of Computing, 1990, pages 427-437.
20. K. Ohta and T. Okamoto: On Concrete Security Treatment of Signatures Derived from Identification, Advances in Cryptology - Proceedings of CRYPTO '98, Vol. 1462 of LNCS, Springer-Verlag, Berlin, 1998, pages 354-369.
21. T. Okamoto and D. Pointcheval: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes, Proceedings of Public Key Cryptography 2001 (PKC 2001), Vol. 1992 of LNCS, Springer-Verlag, Berlin, 2001, pages 104-118.
22. D. Pointcheval: Chosen-Ciphertext Security for Any One-Way Cryptosystem, Proceedings of Public Key Cryptography 2000 (PKC 2000), Vol. 1751 of LNCS, Springer-Verlag, Berlin, 2000, pages 129-146.
23. D. Pointcheval and J. Stern, Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, Vol. 13, No. 3, Springer-Verlag, Berlin, 2000, pages 361-396.
24. C. Rackoff and D. Simon : Non-Interacitve Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack, Advances in Cryptology - Proceedings of CRYPTO '91, Vol. 576 of LNCS, Springer-Verlag, Berlin, 1992, pages 433-444.
25. P. Rogaway, M. Bellare, J. Black and T. Krovetz: OCB: A Block-Cipher Mode of Operation for Efficient Authenticated Encryption, Proceedings of the 8th ACM Conference on Computer and Communications Security, 2001, pages 196-205.
26. C. P. Schnorr: Efficient Identification and Signatures for Smart Cards, Advances in Cryptology - Proceedings of CRYPTO '89, Vol. 435 of LNCS, Springer-Verlag, Berlin, 1990, pages 235-251.
27. C. P. Schnorr and M. Jakobsson: Security of Signed ElGamal Encryption, Advances in Cryptology - Proceedings of ASIACRYPT2000, Vol. 1976 of LNCS, Springer-Verlag, Berlin, 2000, pages 73-89.
28. V. Shoup: Sequences of Games: A Tool for Taming Complexity in Security Proofs, Report 2004/332, International Association for Cryptographic Research (IACR) ePrint Archive, 2004.
29. V. Shoup and R. Gennaro: Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Advances in Cryptology - Proceedings of EUROCRYPT '98, Vol. 1403 of LNCS, Springer-Verlag, Berlin, 1998, pages 1-16.
30. R. Steinfeld: Analysis and Design of Public-Key Cryptographic Schemes, Ph.D. Thesis, Monash University, January 2003.
31. R. Steinfeld and Y. Zheng: A Signcryption Scheme Based on Integer Factorization, Proceedings of Information Security Workshop 2000 (ISW 2000), Vol. 1975 of LNCS, Springer-Verlag, Berlin, 2000, pages 308-322.
32. Y. Tsiounis and M. Yung: On the Security of ElGamal-Based Encryption, Proceedings of Public Key Cryptography '98 (PKC '98), Vol. 1431 of LNCS, Springer-Verlag, Berlin, 1998, pages 117-134.
33. Y. Zheng: Digital Signcryption or How to Achieve Cost (Signature & Encryption) ≪ Cost (Signature) + Cost (Encryption), Advances in Cryptology - Proceedings CRYPTO '97, Vol. 1294 of LNCS, Springer-Verlag, Berlin, 1997, pages 165-179.
34. Y. Zheng: Digital Signcryption or How to Achieve Cost (Signature & Encryption) ≪C Cost (Signature) + Cost (Encryption), full version, available at http://www.sis.uncc.edu/~yzheng/papers/.
35. Y. Zheng and H. Imai: Efficient Signcryption Schemes on Elliptic Curves, Proceedings of the IFIP 14th International Information Security Conference (IFIP/SEC '98), Chapman and Hall, New York, 1998, pages 75-84.
36. Y. Zheng and J. Seberry: Immunizing Public Key Cryptosystems against Chosen Ciphertext Attacks, IEEE Journal on Selected Areas in Communications, Vol. 11, No. 5, 1993, pages 715-724 (Special Issue on Secure Communications).