CryptoDB
Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption
| Authors: | |
|---|---|
| Download: | |
| Conference: | PKC 2018 |
| Abstract: | This paper presents two non-generic and practically efficient private key multi-input functional encryption (MIFE) schemes for the multi-input version of the inner product functionality that are the first to achieve simultaneous message and function privacy, namely, the full-hiding security for a non-trivial multi-input functionality under well-studied cryptographic assumptions. Our MIFE schemes are built in bilinear groups of prime order, and their security is based on the standard k-Linear (k-LIN) assumption (along with the existence of semantically secure symmetric key encryption and pseudorandom functions). Our constructions support polynomial number of encryption slots (inputs) without incurring any super-polynomial loss in the security reduction. While the number of encryption slots in our first scheme is apriori bounded, our second scheme can withstand an arbitrary number of encryption slots. Prior to our work, there was no known MIFE scheme for a non-trivial functionality, even without function privacy, that can support an unbounded number of encryption slots without relying on any heavy-duty building block or little-understood cryptographic assumption. |
BibTeX
@inproceedings{pkc-2018-28915,
title={Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption},
booktitle={Public-Key Cryptography – PKC 2018},
series={Public-Key Cryptography – PKC 2018},
publisher={Springer},
volume={10770},
pages={245-277},
doi={10.1007/978-3-319-76581-5_9},
author={Pratish Datta and Tatsuaki Okamoto and Junichi Tomida},
year=2018
}