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 correspond to vectors (Formula presented.) secret keys correspond to vectors (Formula presented.) and a decryptor learns (Formula presented.) 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.
CITATION STYLE
Bishop, A., Jain, A., & Kowalczyk, L. (2015). Function-hiding inner product encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9452, pp. 470–491). Springer Verlag. https://doi.org/10.1007/978-3-662-48797-6_20
Mendeley helps you to discover research relevant for your work.