Efficient signcryption without random oracles

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

Volumn 4158 LNCS, Issue , 2006, Pages 449-458

  Wu, Qianhong ^a   Mu, Yi ^a   Susilo, Willy ^a   Zhang, Fangguo ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATA PRIVACY; MATHEMATICAL MODELS; SECURITY OF DATA;

CONFIDENTIALITY; RANDOM ORACLES; RATIONAL COMPUTATIONAL ASSUMPTIONS; SIGNCRYPTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33750052872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11839569_43     Document Type: Conference Paper

References (19)

1. J. H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. Eurocrypt'02, LNCS 2332, pp. 83-107. Springer-Verlag, 2002.
2. B. Barak. How to go beyond the black-box simuation barrier. In 42nd FOCS, pp. 106-115. IEEE Computer Soceity, 2001. Available at: http://www.wisdom. weizmann.ac.il/ boaz.
3. B. Barak, Y. Lindell, and S. P. Vadhan. Lower bounds for non-black-box zero knowledge. In FOCS'03, pp. 384-393. IEEE Computer Soceity, 2003.
4. D. Boneh and X. Boyen. Short signatures without random oracles. Eurocrypt'04, LNCS 3027, pp. 56-73. Springer-Verlag, 2004.
5. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. Crypto'01, LNCS 2139, pp. 213-229. Springer-Verlag, 2001.
6. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. Asiacrypt'01, LNCS 2248, pp. 514-532. Springer-Verlag, 2001.
7. X. Boyen. Multipurpose identity-based signcryption: A swiss army knife for identity-based cryptography. Crypto'03, LNCS 2729, pp. 382-398. Springer-Verlag, 2003.
8. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. 1st ACM Conference on Computer and Communications Security, pp. 62-73. ACM press, 1993.
9. J. Baek, R. Steinfeld, and Y. Zheng. Formal proofs for the security of signcryption. PKC'02, LNCS 2274, pp. 80-98. Springer-Verlag, 2002.
10. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. Journal of the ACM, Vol. 51, No. 4, pp.557-594, July 2004.
11. L. Chen and J. M. Lee, Improved identity-based signcryption. PKC'05, LNCS 3386, pp. 362-379. Springer-Verlag, 2005.
12. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Crypto'98, LNCS 1462. Springer-Verlag, 1998.
13. S. Goldwasser, and Y. T. Kalai. On the (in)security of the fiat-shamir paradigm. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 102-113. IEEE press, 2003.
14. J. M. Lee. A General Construction for Simultaneous Siging and encrypting. Cryptography and Coding 2005, LNCS 3796, pp. 116-135. Springer-Verlag, 2005.
15. B. Libert and J. J. Quisquater. New identity-based signcryption schemes from pairings. In IEEE Information Theory Workshop 2003, pp. 155-158. IEEE press, 2003.
16. B. Libert, and J. Quisquater. Improved signcryption from q-Diffie-Hellman problems. SCN'04, LNCS 3352, pp. 220-234. Springer-Verlag, 2005.
17. J. M. Lee, W. Mao. Two birds one stone: Signcryption using RSA. CT-RSA'03, LNCS 2612, pp. 211-225. Springer-Verlag, 2003.
18. R. Zhang, J. Furukawa and H. Imai. Short signature and universal designated verifier signature without random oracles. ACNS 2005, LNCS 3531, pp. 483-498. Springer-Verlag, 2005.
19. Y. Zheng. Digital signcryption or how to achieve cost (signature & encryption) ≪ cost (signature) + cost (encryption). Crypto'97, LNCS 1294, pp. 165-179. Springer-Verlag, 1997.