Secure public-key encryption scheme without random oracles

Information Sciences

Volumn 178, Issue 17, 2008, Pages 3435-3442

  Tan, Chik How ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Cryptography; Decisional bilinear Diffie Hellman assumption; Public key encryption; Publicly verifiable

Indexed keywords

ALUMINUM; COMPUTATIONAL EFFICIENCY; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; RANDOM PROCESSES;

(PL) PROPERTIES; BILINEAR DIFFIE HELLMAN; COLLISION RESISTANT HASH FUNCTIONS; ELSEVIER (CO); GENERIC TRANSFORMATIONS; HASH FUNCTIONS; IDENTITY BASED ENCRYPTION (IBE); PUBLIC-KEY ENCRYPTIONS; PUBLICLY VERIFIABLE; RANDOM ORACLES; SECURITY REDUCTION; SIGNATURE SCHEMES; TRANSFORMATION TECHNIQUES;

CRYPTOGRAPHY;

EID: 45849118378     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.04.006     Document Type: Article

References (26)

1. Boneh D., and Boyen X. Secure identity based encryption without random oracles. Advances in Cryptology - Crypto'04. Lecture Notes in Computer Science vol. 3152 (2004), Springer-Verlag 443-459
2. Boneh D., and Boyen X. Efficient selective-id secure identity based encryption without random oracles. Advances in Cryptology - Eurocrypt'04. Lecture Notes in Computer Science vol. 3027 (2004), Springer-Verlag 223-238
3. Boneh D., and Boyen X. Short signatures without random oracles. Advances in Cryptology - Eurocrypt'04. Lecture Notes in Computer Science vol. 3027 (2004), Springer-Verlag 56-73
4. Boneh D., Canetti R., Halevi S., and Katz J. Chosen-ciphertext security from identity-based encryption. SIAM J. Comput. 36 5 (2007) 1301-1328
5. Boneh D., and Katz J. Improved efficiency for CCA-secure cryptosystems built using identity based encryption. Topics in Cryptology - CT-RSA 2005. Lecture Notes in Computer Science vol. 3376 (2005), Springer-Verlag 87-103
6. Boyen X., Mei Q., and Waters B. Direct chosen ciphertext security from identity-based techniques. ACM Conference on Computer and Communications Security - CCS 2005 (2005), ACM Press 320-329
7. Castagnos G. An efficient probabilistic public-key cryptosystem over quadratic fields quotients. Finite Fields Appl. 13 3 (2007) 563-576
8. Canetti R., Halevi S., and Katz J. Chosen-ciphertext security from identity-based encryption. Advances in Cryptology - Eurocrypt'04. Lecture Notes in Computer Science vol. 3027 (2004), Springer-Verlag 207-222
9. Canetti R., Halevi S., and Katz J. A forward-secure public-key encryption scheme. J. Cryptol. 20 3 (2007) 265-294
10. Cramer R., and Shoup V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Advances in Cryptology - Crypto'98. Lecture Notes in Computer Science vol. 1462 (1998), Springer-Verlag 13-25
11. Cramer R., and Shoup V. Universal hash proofs and paradigm for adaptive chosen ciphertext secure public-key encryption. Advances in Cryptology - Eurocrypt'02. Lecture Notes in Computer Science vol. 2332 (2002), Springer-Verlag 46-64
12. Cramer R., and Shoup V. Design and analysis of practical public-key encryption schemes secure adaptive chosen ciphertext attack. SIAM J. Comput. 33 1 (2003) 167-226
13. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory 31 4 (1985) 469-472
14. D. Galindo, P. Morillo, C. Rfols, Improved certificate-based encryption in the standard model, J. Syst. Software (2007), doi:10.1016/j.jss.2007.09.009.
15. Long Y., and Chen K. Certificateless threshold cryptosystem secure against chosen-ciphertext attack. Inform. Sci. 177 24 (2007) 5620-5637
16. MIRACL, Multi-precision integer and rational arithmetic C/C++ library, Shamus Software Ltd. .
17. Rackoff C., and Simon D. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. Advances in Cryptology - Crypto'91. Lecture Notes in Computer Science vol. 576 (1991), Springer-Verlag 46-64
18. V. Shoup, Sequences of games: a tool for taming complexity in security proofs, 2004. .
19. Tan C.H. Chosen ciphertext security from identity-based encryption without strong condition. Advances in Information and Computer Security. Lecture Notes in Computer Science vol. 4266 (2006), Springer-Verlag 292-307
20. Tan C.H. Public-key encryption from ID-based encryption without one-time signature. On the Move Conference. Lecture Notes in Computer Science vol. 4277 (2006), Springer-Verlag 450-459
21. Teranishi I., Oyama T., and Ogata W. General conversion for obtaining strongly existentially unforgeable signatures. Progress in Cryptology - Indocrypt'06. Lecture Notes in Computer Science vol. 4329 (2006), Springer-Verlag 191-205
22. Teranishi I., Oyama T., and Ogata W. General conversion for obtaining strongly existentially unforgeable signatures. IEICE Trans. Fundamentals E91-A 1 (2008) 94-106
23. Wang B., Wu Q., and Hu Y. A knapsack-based probabilistic encryption scheme. Inform. Sci. 177 19 (2007) 3981-3994
24. Waters B. Efficient identity-based encryption without random oracles. Advances in Cryptology - Eurocrypt'05. Lecture Notes in Computer Science vol. 3494 (2005), Springer-Verlag 114-127
25. Wu T.S., Hsu C.L., Tsai K.Y., Lin H.Y., and Wu T.C. Convertible multi-authenticated encryption scheme. Inform. Sci. 178 1 (2008) 256-263
26. Zhang R. Tweaking TBE/IBE to PKE transforms with chameleon hash functions. Applied Cryptography and Network Security - ACNS'07. Lecture Notes in Computer Science vol. 4521 (2007), Springer-Verlag 323-339