Paper 2024/273
Perfect 2-Party Computation from Additive Somewhat Homomorphic Encryption
Abstract
Two-party computation has been an active area of research since Yao's breakthrough results on garbled circuits. We present secret key somewhat additive homomorphic schemes where the client has perfect privacy (server can be computationally unbounded). Our basic scheme is somewhat additive homomorphic and we extend it to support multiplication. The server handles circuit multiplication gates by returning the multiplicands to the client which updates the decryption key so that the original ciphertext vector includes the encrypted multiplication gate outputs. We give a 2-party protocol that also incorporates server inputs where the client has perfect privacy. Server privacy holds against a computationally bounded adversary since it depends on the hardness of the subset sum problem. Correctness of the server in the malicious model can be verified by a 3rd party where the client and server privacy are protected from the verifier.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- somewhat homomorphic encryptionperfect security
- Contact author(s)
- jonattr @ gmail com
- History
- 2025-04-10: last of 8 revisions
- 2024-02-18: received
- See all versions
- Short URL
- https://ia.cr/2024/273
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/273,
author = {Jonathan Trostle},
title = {Perfect 2-Party Computation from Additive Somewhat Homomorphic Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/273},
year = {2024},
url = {https://eprint.iacr.org/2024/273}
}