Fully secure inner-product proxy re-encryption with constant size ciphertext

Conference contribution
(Conference Contribution)

Publication Details

Author(s): Backes M, Gagné M, Thyagarajan SAK
Publisher: Association for Computing Machinery, Inc
Publication year: 2015
Pages range: 31-40
ISBN: 9781450334471


In this paper, we present a new inner product proxy reencryption scheme. The scheme can easily be converted into an attribute-based proxy re-encryption scheme for threshold policies, and can be used to provide fine-grained access control in cloud storage systems. Our scheme is very efficient, requiring a number of exponentiations that is linear in the length of the vector 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.

FAU Authors / FAU Editors

Thyagarajan, Sri Aravinda Krishnan
Lehrstuhl für Informatik 13 (Angewandte Kryptographie)

External institutions with authors

Universität des Saarlandes (UdS)
Wheaton College

How to cite

Backes, M., Gagné, M., & Thyagarajan, S.A.K. (2015). Fully secure inner-product proxy re-encryption with constant size ciphertext. (pp. 31-40). Association for Computing Machinery, Inc.

Backes, Michael, Martin Gagné, and Sri Aravinda Krishnan Thyagarajan. "Fully secure inner-product proxy re-encryption with constant size ciphertext." Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, SCC 2015 Association for Computing Machinery, Inc, 2015. 31-40.


Last updated on 2018-26-11 at 13:50