Paper 2021/1118
THC: Practical and Cost-Effective Verification of Delegated Computation
Pablo Rauzy and Ali Nehme
Abstract
Homomorphic cryptography is used when computations are delegated to an untrusted third-party. However, there is a discrepancy between the untrustworthiness of the third-party and the silent assumption that it will perform the expected computations on the encrypted data. This may raise serious privacy concerns, for example when homomorphic cryptography is used to outsource resource-greedy computations on personal data (e.g., from an IoT device to the cloud). In this paper we show how to cost-effectively verify that the delegated computation corresponds to the expected sequence of operations, thus drastically reducing the necessary level of trust in the third-party. Our approach is based on the well-known modular extension scheme: it is transparent for the third-party and it is not tied to a particular homomorphic cryptosystem nor depends on newly introduced (and thus less-studied) cryptographic constructions. We provide a proof-of-concept implementation, THC (for "trustable homomorphic computation"), which we use to perform security and performance analyses. We then demonstrate its practical usability, in the case of a toy electronic voting system.
Note: This paper will appear in CANS 2021.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Minor revision. CANS 2021
- Keywords
- Data and Computation IntegritySecurity and Privacy in the CloudUsable Security
- Contact author(s)
- pr @ up8 edu
- History
- 2021-09-03: revised
- 2021-09-03: received
- See all versions
- Short URL
- https://ia.cr/2021/1118
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1118,
author = {Pablo Rauzy and Ali Nehme},
title = {{THC}: Practical and Cost-Effective Verification of Delegated Computation},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1118},
year = {2021},
url = {https://eprint.iacr.org/2021/1118}
}
