Analysis and improvement of a signcryption scheme with key privacy

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

Volumn 3650 LNCS, Issue , 2005, Pages 218-232

  Yang, Guomin ^a   Wong, Duncan S ^a   Deng, Xiaotie ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bilinear Pairings; Ciphertext Anonymity; Gap Diffie Hellman Groups; Key Privacy; Signcryption

Indexed keywords

DATA PRIVACY; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SECURITY OF DATA;

BILINEAR PAIRINGS; CIPHERTEXT ANONYMITY; GAP DIFFIE-HELLMAN GROUPS; KEY PRIVACY; SIGNCRYPTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33645964923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11556992_16     Document Type: Conference Paper

References (17)

1. J.H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Proc. EUROCRYPT 2002, pages 83-107. Springer-Verlag, 2002. LNCS 2332.
2. F. Bao and R. H. Deng. A signcryption scheme with signature directly verifiable by public key. In PKC'98, pages 55-59. Springer-Verlag, 1998. LNCS 1431.
3. J. Beak, R. Steinfeld, and Y. Zheng. Formal proofs for the security of signcryption. In PKC'02, pages 80-98. Springer-Verlag, 2002. LNCS 2274.
4. M. Bellare, A. Boldyreva, A. Desai, and D. Pointcheval. Key-privacy in public-key encryption. In Proc. ASIACRYPT 2001, pages 566-582. Springer-Verlag, 2001. LNCS 2248.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62-73, Fairfax, 1993. ACM.
6. D. Boneh. The decision Diffie-Hellman problem. In Proc. of the Third Algorithmic Number Theory Symposium, pages 48-63. Springer-Verlag, 1998. LNCS 1423.
7. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. In Proc. CRYPTO 2001, pages 213-229. Springer-Verlag, 2001. LNCS 2139.
8. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Proc. ASIACRYPT 2001, pages 514-532. Springer-Verlag, 2001. LNCS 2248.
9. X. Boyen. Multipurpose identity-based signcryption: A swiss army knife for identity-based cryptography. In Proc. CRYPTO 2003, pages 383-399. Springer-Verlag, 2003. LNCS 2729.
10. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM J. Computing, 17(2):281-308, April 1988.
11. B. Libert and J.-J. Quisquater. Efficient signcryption with key privacy from gap Diffie-Hellman groups. In PKC'04, pages 187-200. Springer-Verlag, 2004. LNCS 2947.
12. J. Malone-Lee and W. Mao. Two birds one stone: Signcryption using RSA. In Topics in Cryptology - proceedings of CT-RSA 2003, pages 211-225. Springer-Verlag, 2003. LNCS 2612.
13. Y. Mu and V. Varadharajan. Distributed signcryption. In INDOCRYPT 2000, pages 155-164. Springer-Verlag, 2000. LNCS 1977.
14. C. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Proc. CRYPTO 91, pages 433-444. Springer, 1992. LNCS 576.
15. R. Steinfeld and Y. Zheng. A signcryption scheme based on integer factorization. In ISW'00, pages 308-322. Springer-Verlag, 2000. LNCS 1975.
16. D. H. Yum and P. J. Lee. New signcryption schemes based on KCDSA. In Information Security and Cryptology - ICISC 2001, pages 305-317. Springer-Verlag, 2002. LNCS 2288.
17. Y. Zheng. Digital signcryption or how to achieve cost (signature & encryption) ≤ cost (signature) + cost (encryption). In Proc. CRYPTO 97, pages 165-179. Springer-Verlag, 1997. LNCS 1294.