Conditional proxy re-encryption secure against chosen-ciphertext attack

ABSTRACT

In a proxy re-encryption (PRE) system [4], a proxy, authorized by Alice, can convert a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. PRE has found many practical applications requiring delegation. However, it is inadequate to handle scenarios where a fine-grained delegation is demanded. To overcome the limitation of existing PRE systems, we introduce the notion of conditional proxy re-encryption (C-PRE), whereby only ci-phertext satisfying a specific condition set by Alice can be transformed by the proxy and then decrypted by Bob. We formalize its security model and propose an efficient C-PRE scheme, whose chosen-ciphertext security is proven under the 3-quotient bilinear Diffie-Hellman assumption. We further extend the construction to allow multiple conditions with a slightly higher overhead.

REFERENCES

• 1: G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved proxy re-encryption schemes with applications to secure distributed storage. In NDSS 2005, pages 29--43.
• 2: Giuseppe Ateniese , Kevin Fu , Matthew Green , Susan Hohenberger, Improved proxy re-encryption schemes with applications to secure distributed storage, ACM Transactions on Information and System Security (TISSEC), v.9 n.1, p.1-30, February 2006 [doi>10.1145/1127345.1127346]
• 3: J. Baek, R. Safavi-Naini, and W. Susilo. Certificatless public key encryption without pairing. In ISC 2005, pages 134--148. Springer-Verlag.
• 4: M. Blaze, G. Bleumer, and M. Strauss. Divertible protocols and atomic proxy cryptography. In In advances in Cryptology-Eurocrypt 1998, pages 127--144. Springer-Verlag.
• 5: D. Boneh and X. Boyen. Efficient selective-id secure identity based encryption without random oracles. In In advances in Cryptology-Eurocrypt 2004, pages 223--238. Springer-Verlag.
• 6: Dan Boneh , Matthew K. Franklin, Identity-Based Encryption from the Weil Pairing, Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, p.213-229, August 19-23, 2001
• 7: D. Boneh, E.-J. Goh, and T. Matsuo. Proposal for p1363.3 proxy re-encryption. In http://grouper.ieee.org/groups/1363/IBC/submissions/NTTDataProposal-for- P1363.3-2006-08-14.pdf.
• 8: Ran Canetti , Susan Hohenberger, Chosen-ciphertext secure proxy re-encryption, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA [doi>10.1145/1315245.1315269]
• 9: C. Chu and W. Tzeng. Identity-based proxy re-encryption without random oracles. In ISC 2007, pages 189--202. Springer-Verlag.
• 10: Jean-Sébastien Coron, On the Exact Security of Full Domain Hash, Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology, p.229-235, August 20-24, 2000
• 11: Robert H. Deng , Jian Weng , Shengli Liu , Kefei Chen, Chosen-Ciphertext Secure Proxy Re-encryption without Pairings, Proceedings of the 7th International Conference on Cryptology and Network Security, December 02-04, 2008, Hong-Kong, China [doi>10.1007/978-3-540-89641-8_1]
• 12: Y. Dodis and A.-A. Ivan. Proxy cryptography revisited. In NDSS 2003.
• 13: Taher El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms, Proceedings of CRYPTO 84 on Advances in cryptology, p.10-18, August 1985, Santa Barbara, California, United States
• 14: Eiichiro Fujisaki , Tatsuaki Okamoto, Secure Integration of Asymmetric and Symmetric Encryption Schemes, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.537-554, August 15-19, 1999
• 15: Matthew Green , Giuseppe Ateniese, Identity-Based Proxy Re-encryption, Proceedings of the 5th international conference on Applied Cryptography and Network Security, June 05-08, 2007, Zhuhai, China [doi>10.1007/978-3-540-72738-5_19]
• 16: Markus Jakobsson, On Quorum Controlled Asymmetric Proxy Re-encryption, Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography, p.112-121, March 01-03, 1999
• 17: Benoît Libert , Damien Vergnaud, Tracing Malicious Proxies in Proxy Re-encryption, Proceedings of the 2nd international conference on Pairing-Based Cryptography, September 01-03, 2008, Egham, UK [doi>10.1007/978-3-540-85538-5_22]
• 18: B. Libert and D. Vergnaud. Unidirectional chosen-ciphertext secure proxy re-encryption. In PKC 2008, pages 360--379. Springer-Verlag.
• 19: M. Mambo and E. Okamoto. Proxy cryptosystems: Delegation of the power to decrypt ciphertexts. IEICE Trans. Fund. Electronics Communications and Computer Science, E80-A(1):54--63.
• 20: J. Weng, R. H. Deng, S. Liu, K. Chen, J. Lai, and X. Wang. Chosen-ciphertext secure proxy re-encryption schemes without pairings. In http://eprint.iacr.org/2008/509.pdf (full paper of {11}).

INDEX TERMS

Primary Classification:
  E. Data
  E.3 DATA ENCRYPTION

General Terms:
Security

Keywords:
bilinear pairing, chosen-ciphertext security, conditional proxy re-encryption