Signcryption with non-interactive non-repudiation

Designs, Codes, and Cryptography

Volumn 37, Issue 1, 2005, Pages 81-109

  Malone Lee, John ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Non repudiation; Provable security; Signcryption

Indexed keywords

COMPOSITION; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

NON-REPUDIATION; PROVABLE SECURITY; SIGNCRYPTION;

SECURITY SYSTEMS;

EID: 23944489541     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-004-3806-6     Document Type: Article

References (33)

1. M. Abdalla, M. Bellare and P. Rogaway, The Oracle Diffie-Hellman assumptions and an analysis of DHIES. In Topics in Cryptology - CT-RSA 2001, Lecture Notes in Computer Science, Vol. 2020, Springer-Verlag (2001) pp. 143-158.
2. J. H. An, Y. Dodis and T. Rabin, On the Security of Joint Signature and Encryption. In Advances in Cryptology - EUROCRYPT 2002, Lecture Notes in Computer Science, Vol. 2332, Springer-Verlag (2002) pp. 83-107.
3. J. Baek, R. Steinfeld and Y. Zheng, Formal proofs for the security of signcryption. In Public Key Cryptography - PKC 2002, Lecture Notes in Computer Science, Vol. 2274, Springer-Verlag (2002) pp. 80-98.
4. F. Bao and R. H. Deng, A Signcryption scheme with signature directly verifiable by public key. In Public Key Cryptography - PKC '98, Lecture Notes in Computer Science, Vol. 1431, Springer-Verlag (1998) pp. 55-59.
5. P. S. L. M. Barreto, H. Y. Kim, B. Lynn and M. Scott, Efficient algorithms for paring-based cryptosystems. In Advances in Cryptology - CRYPTO 2002, Lecture Notes in Computer Science, Springer-Verlag (2002) pp. 354-368.
6. M. Bellare, A. Boldyreva and S. Micali, Public-key encryption in a multi-user setting: Security proofs and improvements. In Advances in Cryptology - EUROCRYPT 2000, Lecture Notes in Computer Science, Vol. 1807, Springer-Verlag (2000) pp. 259-274.
7. M. Bellare, A. Desai, E. Jokipii and P. Rogaway, A concrete security treatment of symmetric encryption. In 38th Annual Symposium on Foundations of Computer Science, IEEE Computer Science Press (1997) pp. 394-403.
8. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, Relations among notions of security for public-key encryption schemes. In Advances in Cryptology - CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462, Springer-Verlag (1998) pp. 26-45.
9. M. Bellare, M. Jakobsson and M. Yung, Round-optimal zero-knowledge arguments based on any one-way function. In Advances in Cryptology - EUROCRYPT '97, Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag (1997) pp. 280-305.
10. M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security (1993) pp. 62-73.
11. M. Bellare and P. Rogaway, Optimal Asymmetric Encryption - How to encrypt with RSA. In Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science, Vol. 950, Springer-Verlag (1994) pp. 92-111.
12. D. Boneh and M. Franklin, Identity-based encryption from the weil pairing. In Advances in Cryptology - CRYPTO 2001, Lecture Notes in Computer Science, Vol. 2139, Springer-Verlag (2001) pp. 213-229.
13. G. Brassard, D. Chaum and C. Crépeau, Minimum disclosure proofs of knowledge. J. Computer Syst. Sci. Vol. 37 (1988) pp. 156-189.
14. J. C. Cha and J. H. Cheon, An identity-based signature from gap diffie-hellman groups. In Public Key Cryptography - PKC 2003, Lecture Notes in Computer Science, Vol. 2567, Springer-Verlag (2003) pp. 18-30
15. D. Chaum and T. P. Pederson, Wallet databases with observers. In Advances in Cryptology CRYPTO '92, Lecture Notes in Computer Science, Vol. 740, Springer-Verlag (1993) pp. 89-105.
16. R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology - CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462, Springer-Verlag (1998) pp. 13-25.
17. R. Cramer and V. Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. In SIAM J. Comput.,Vol. 33, Issue 1 (2003) pp. 167-226.
18. S. Galbraith, K. Harrison and D. Soldera, Implementing the Tate pairing. In Algorithmic Number Theory (ANTS V) Lecture Notes in Computer Science, Vol. 2369, Springer-Verlag (2002) pp. 324-337.
19. S. Galbraith, J. Malone-Lee and N. P. Smart, Public key signatures in the multi-user setting. Inform. Process. Lett. Vol. 83, Issue 5 (2002) pp. 263-266.
20. S. Goldwasser and S. Micali, Probabilistic encryption. J. Computer Syst. Sci. Vol. 28 (1984) pp. 270-299.
21. S. Goldwasser, S. Micali and R. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., Vol. 17, Issue 2 (1998) pp. 281-308.
22. W. H. He and T. C. Wu, Cryptanalysis and improvement of Petersen-Michels signcryption scheme. IEE Proc. - Computers Digital Techniques, Vol. 146, Issue 2 (1999) pp. 123-124.
23. F. Hess, Efficient identity based signature schemes based on pairings. In Selected Areas in Cryptography (2002), Lecture Notes in Computer Science, Vol. 2595, Springer-Verlag, (2003) pp. 310-324.
24. M. K. Lee, D. K. Kim and K. Park, An authenticated encryption scheme with public verifiability. In 4th Korea-Japan Joint Workshop on Algorithms and Computation, (2000) pp. 49-56.
25. A. J. Menezes, T. Okamato and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory, Vol. 39, Issue 5 (1993) pp. 1639-1646.
26. K. Ohta and T. Okamoto, On concrete security treatment of signatures derived from identification. In Advances in Cryptology - CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462, Springer-Verlag (1998) pp. 354-369.
27. K. G. Patterson, ID-based signatures from pairings on elliptic curves. Electron Lett. Vol. 38, Issue 18 (2002) pp. 1025-1026.
28. H. Petersen and M. Michels, Cryptanalysis and improvement of signcryption schemes. IEE Proc. -Computers Digital Techniques, Vol. 145, Issue 2 (1998) pp. 149-151.
29. C. P. Schnorr, Efficient identification and signatures for smart cards. In Advances in Cryptology -CRYPTO '89, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag (1990) pp. 235-254.
30. C. P. Schnorr, Efficient signature generation by smart cards, J. Cryptol, Vol. 4, Issue 3 (1991) pp. 161-174.
31. N. P. Smart, An identity based authenticated key agreement protocol based on the Weil pairing. Electronic Lett., Vol. 38, Issue 13 (2002) pp. 630-632.
32. E. R. Verheul, Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In Advances in Cryptology - EUROCRYPT 2001, Lecture Notes in Computer Science, Vol. 2045, Springer-Verlag (2001) pp. 195-210.
33. Y. Zheng, Digital signcryption or how to achieve cost(signature & encryption) <