Paper 2025/1491
Homomorphic Secret Sharing with Verifiable Evaluation
, Nexus, Purdue University West Lafayette, Johns Hopkins University, Johns Hopkins University, NTT ResearchAbstract
A homomorphic secret sharing (HSS) scheme allows a client to delegate a computation to a group of untrusted servers while achieving input privacy as long as at least one server is honest. In recent years, many HSS schemes have been constructed that have, in turn, found numerous applications to cryptography. Prior work on HSS focuses on the setting where the servers are semi-honest. In this work we study HSS in the setting of malicious evaluators. We propose the notion of HSS with verifiable evaluation (ve-HSS) that guarantees correctness of output even when all the servers are corrupted. ve-HSS retains all the attractive features of HSS and adds the new feature of succinct public verification of output. We present black-box constructions of ve-HSS by devising generic transformations for semi-honest HSS schemes (with negligible error). This provides a new non-interactive method for verifiable and private outsourcing of computation.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in TCC 2024
- DOI
- 10.1007/978-3-031-78023-3_20
- Contact author(s)
-
arkarai choudhuri @ gmail com
aarushi @ purdue edu
ahegde @ cs jhu edu
abhishek jain @ ntt-research com - History
- 2025-08-20: approved
- 2025-08-18: received
- See all versions
- Short URL
- https://ia.cr/2025/1491
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1491,
author = {Arka Rai Choudhuri and Aarushi Goel and Aditya Hegde and Abhishek Jain},
title = {Homomorphic Secret Sharing with Verifiable Evaluation},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1491},
year = {2025},
doi = {10.1007/978-3-031-78023-3_20},
url = {https://eprint.iacr.org/2025/1491}
}
