Function-Hiding Inner Product Encryption

Allison Bishop; Abhishek Jain; Lucas Kowalczyk

Paper 2015/672

Function-Hiding Inner Product Encryption

Allison Bishop, Abhishek Jain, and Lucas Kowalczyk

Abstract

We extend the reach of functional encryption schemes that are provably secure under simple assumptions against unbounded collusion to include function-hiding inner product schemes. Our scheme is a private key functional encryption scheme, where ciphertexts and secret keys correspond to vectors and a decryptor learns the value of the inner product of ciphertext and secret key vectors. Our scheme employs asymmetric bilinear maps and relies only on the SXDH assumption to satisfy a natural indistinguishability-based security notion where arbitrarily many key and ciphertext vectors can be simultaneously changed as long as the key-ciphertext dot product relationships are all preserved.

Note: Minor bug fix.

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: Functional Encryption
Contact author(s): luke @ cs columbia edu
History: 2016-05-31: last of 2 revisions; 2015-07-05: received; See all versions
Short URL: https://ia.cr/2015/672
License: CC BY

BibTeX

@misc{cryptoeprint:2015/672,
      author = {Allison Bishop and Abhishek Jain and Lucas Kowalczyk},
      title = {Function-Hiding Inner Product Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/672},
      year = {2015},
      url = {https://eprint.iacr.org/2015/672}
}