In this paper, we first define two new security models of privacy preserving RPE: the strongly full-hiding security and the weakly full-hiding security. The strongly full-hiding security provides the full privacy of ciphertexts against outside and inside adversaries, but the weakly full-hiding security provides the full privacy of ciphertexts against an outside adversary who cannot decrypt the challenge ciphertext.
Next, we propose a general RPE construction from any PE scheme, and prove its security in the weakly full-hiding security model. Our generic RPE scheme is efficient since the number of ciphertext elements is not proportional to the number of users in a receiver set. Additionally, our RPE scheme can support polynomial-size circuits if a recently proposed FE scheme for polynomial-size circuits is used as an underlying PE scheme.Category / Keywords: public-key cryptography / Public-key encryption, Predicate-encryption, Revocation, Privacy, Adaptive security Original Publication (in the same form): Security and Communication Networks Date: received 16 Nov 2012, last revised 26 Feb 2014 Contact author: guspin at korea ac kr Available format(s): PDF | BibTeX Citation Version: 20140226:222515 (All versions of this report) Short URL: ia.cr/2012/655 Discussion forum: Show discussion | Start new discussion