Abstract
Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher efficiency and stronger security.
Similar content being viewed by others
References
Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography. In: Nyberg K, ed. Eurocrypt. Lecture Notes in Computer Science, Vol. 1403. Berlin: Springer-Verlag, 1998. 127–144
Ateniese G, Fu K, Green M, et al. Improved proxy re-encryption schemes with applications to secure distributed storage. In: proceedings of NDSS’05, The Internet Society. San Diego, California, USA, 2005
Ateniese G, Fu K, Green M, et al. Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans Inf Syst Secur, 2006, 9: 1–30
Canetti R, Hohenberger S. Chosen-ciphertext secure proxy re-encryption. In: Ning P, di Vimercati S D C, Syverson P F, eds. ACM Conference on Computer and Communications Security. New York: ACM, 2007. 185–194
Libert B, Vergnaud D. Unidirectional chosen-ciphertext secure proxy re-encryption. In: Cramer R, ed. Public Key Cryptography. Lecture Notes in Computer Science, Vol. 4939. Berlin: Springer-Verlag, 2008. 360–379 (full paper available at http://hal.inria.fr/inria-00339530/en)
Canetti R, Krawczyk H, Nielsen J B. Relaxing chosenciphertext security. In: Boneh D, ed. CRYPTO. Lecture Notes in Computer Science, Vol. 2729. Berlin: Springer-Verlag, 2003. 565–582
Shao J. Proxy re-cryptography revisited (in Chinese). PhD thesis. Shanghai: Shanghai Jiao Tong University. China Academic Journal Online Publication Integrated Database. 2008
Deng R H, Weng J, Liu S, et al. Chosen-ciphertext secure proxy re-encryption without pairings. In: Franklin M K, Hui L C K, Wong D S, eds. CANS. Lecture Notes in Computer Science, Vol. 5339. Berlin: Springer-Verlag, 2008. 1–17
Shao J, Cao Z. CCA-secure proxy re-encryption without pairings. In: Jarecki S, Tsudik G, eds. Public Key Cryptography. Lecture Notes in Computer Science, Vol. 5443. Berlin: Springer-Verlag, 2009. 357–376
Tang Q. Type-based proxy re-encryption and its construction. In: Chowdhury D R, Rijmen V, Das A, eds. INDOCRYPT. Lecture Notes in Computer Science, Vol. 5365. Berlin: Springer-Verlag, 2008. 130–144
Weng J, Deng R H, Ding X, et al. Conditional proxy re-encryption secure against chosen-ciphertext attack. In: Li W, Susilo W, Tupakula U K, et al., eds. ASIACCS. New York: ACM, 2009. 322–332
Weng J, Yang Y, Tang Q, et al. Effcient conditional proxy re-encryption with chosen-ciphertext security. In: Samarati P, Yung M, Martinelli F, eds. ISC. Lecture Notes in Computer Science, Vol. 5735. Berlin: Springer-Verlag, 2009. 151–166
Chu C K, Weng J, Chow S S M, et al. Conditional proxybroadcast re-encryption. In: Boyd C, Nieto J M G, eds. ACISP. Lecture Notes in Computer Science, Vol. 5594. Berlin: Springer-Verlag, 2009. 327–342
Libert B, Vergnaud D. Tracing malicious proxies in proxy re-encryption. In: Galbraith S D, Paterson K G, eds. Pairing. Lecture Notes in Computer Science, Vol. 5209. Berlin: Springer-Verlag, 2008. 332–353
Matsuo T. Proxy re-encryption systems for identity-based encryption. In: Takagi T, Okamoto T, Okamoto E, eds. Pairing. Lecture Notes in Computer Science, Vol. 4575. Berlin: Springer-Verlag, 2007. 247–267
Green M, Ateniese G. Identity-based proxy re-encryption. In: Katz J, Yung M, eds. ACNS. Lecture Notes in Computer Science, Vol. 4521. Berlin: Springer-Verlag, 2007. 288–306
Chu C K, Tzeng W G. Identity-based proxy re-encryption without random oracles. In: Garay J A, Lenstra A K, Mambo M. et al. eds. ISC. Lecture Notes in Computer Science, Vol. 4779. Berlin: Springer-Verlag, 2007. 189–202
Cramer R, Shoup V. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J Comput, 2004, 33: 167–226
Goldreich O, Goldwasser S, Micali S. How to construct random functions. J ACM, 1986, 33: 792–807
Boneh D, Boyen X.E Effcient selective-ID secure identity-based encryption without Random Oracles. In: Cachin C, Camenisch J, eds. Eurocrypt. Lecture Notes in Computer Science, Vol. 3027. Berlin: Springer-Verlag, 2004. 223–238
Hohenberger S, Waters B. Realizing hash-and-sign signatures under standard assumptions. In: Joux A, ed. Eurocrypt. Lecture Notes in Computer Science, Vol. 5479. Berlin: Springer-Verlag, 2009. 333–350
Coron J S. On the exact security of full domain hash. In: Bellare M, ed. Crypto. Lecture Notes in Computer Science, Vol. 1880. Berlin: Springer-Verlag, 2000. 229–235
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Weng, J., Chen, M., Yang, Y. et al. CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles. Sci. China Inf. Sci. 53, 593–606 (2010). https://doi.org/10.1007/s11432-010-0047-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-0047-3