Paper 2020/1526
Flexible and Efficient Verifiable Computation on Encrypted Data
Alexandre Bois, Ignacio Cascudo, Dario Fiore, and Dongwoo Kim
Abstract
We consider the problem of verifiable and private delegation of computation [Gennaro et al. CRYPTO'10] in which a client stores private data on an untrusted server and asks the server to compute functions over this data. In this scenario we aim to achieve three main properties: the server should not learn information on inputs and outputs of the computation (privacy), the server cannot return wrong results without being caught (integrity), and the client can verify the correctness of the outputs faster than running the computation (efficiency).
A known paradigm to solve this problem is to use a (non-private) verifiable computation (VC) to prove correctness of a homomorphic encryption (HE) evaluation on the ciphertexts. Despite the research advances in obtaining efficient VC and HE, using these two primitives together in this paradigm is concretely expensive. Recent work [Fiore et al. CCS'14, PKC'20] addressed this problem by designing specialized VC solutions that however require the HE scheme to work with very specific parameters; notably HE ciphertexts must be over
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in PKC 2021
- Keywords
- verifiable computationhomomorphic encryptionhomomorphic hash functions
- Contact author(s)
-
dario fiore @ imdea org
alexandre bois-verdiere @ student ecp fr
ignacio cascudo @ imdea org
Dongwoo Kim @ wdc com - History
- 2021-03-16: revised
- 2020-12-08: received
- See all versions
- Short URL
- https://ia.cr/2020/1526
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1526, author = {Alexandre Bois and Ignacio Cascudo and Dario Fiore and Dongwoo Kim}, title = {Flexible and Efficient Verifiable Computation on Encrypted Data}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1526}, year = {2020}, url = {https://eprint.iacr.org/2020/1526} }