Fully Secure Inner-Product Proxy Re-Encryption with Constant Size Ciphertext
Michael Backes, Martin Gagné, Sri Aravinda Krishnan Thyagarajan · 2015
In this paper, we present a new inner product proxy re-encryption scheme. The scheme can easily be converted into a threshold attribute-based proxy re-encryption scheme, and can be used to provide fine-grained access control in cloud storage systems. Our scheme is very efficient, requiring a linear number of exponentiations and a constant number of pairing computations for encryption and decryption. The length of the ciphertext is also independent of the length of the vector. The scheme is proven adaptively secure under standard assumptions in groups of composite orders.