Paper 2025/1803

Concretely-Efficient Multi-Key Homomorphic Secret Sharing and Applications

Kaiwen He, Massachusetts Institute of Technology
Sacha Servan-Schreiber, Tinfoil
Geoffroy Couteau, Université Paris Cité, CNRS, IRIF
Srinivas Devadas, Massachusetts Institute of Technology
Abstract

Homomorphic secret sharing (HSS) is a powerful cryptographic primitive that enables efficient, low-communication secure computation without the use of fully homomorphic encryption. Public-key HSS is a well-known variant that supports inputs from multiple parties, but all parties must agree on a joint public key before any party can encode their inputs, requiring extra rounds of communication in applications. Recently, Couteau et al. (EUROCRYPT 2025) constructed multi-key HSS (MKHSS)—a new primitive which allows parties to encode their inputs under independent keys—under the DCR assumption. MKHSS assumes only a reusable common reference string, without the need for prior interactions between parties or a public-key infrastructure. In this paper, we construct and implement the first concretely-efficient MKHSS scheme under the same assumptions used by Couteau et al. Using an algorithmic insight that reduces the largest modulus in Couteau et al. from $N^4$ to $N^2$, our optimized implementation can homomorphically multiply inputs in 5.0 milliseconds—while an implementation of Couteau et al. requires 224.6 milliseconds—thereby achieving a $45\times$ speedup. A powerful application of MKHSS is to realize attribute-based non-interactive key exchange (ANIKE), which generalizes password-authenticated key exchange (PAKE) to arbitrary attribute policies. ANIKE is currently only known from MKHSS and in this paper we show the first practical instantiation of ANIKE for two concrete predicate types with applications to geolocation-based key exchange and fuzzy PAKE. We use our implementation to evaluate the first concretely-efficient ANIKE schemes for a range of practically useful policies. Using our implementation, two parties can perform a geolocation-based key exchange in under one second and a fuzzy PAKE on an 8-word passphrase in a few seconds for realistic parameters, on a single core, achieving a roughly $30 \times$ speedup over Couteau et al. for both applications.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Major revision. IEEE S&P 2026
Contact author(s)
khe01 @ mit edu
sacha @ tinfoil sh
couteau @ irif fr
devadas @ mit edu
History
2025-10-08: approved
2025-10-02: received
See all versions
Short URL
https://ia.cr/2025/1803
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/1803,
      author = {Kaiwen He and Sacha Servan-Schreiber and Geoffroy Couteau and Srinivas Devadas},
      title = {Concretely-Efficient Multi-Key Homomorphic Secret Sharing and Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1803},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1803}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.