Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Multi-Key Homomorphic Secret Sharing

Geoffroy Couteau, Lalita Devadas, Aditya Hegde, Abhishek Jain, Sacha Servan-Schreiber

Published Jan 1, 2025• 12 citations
Publisher
DOI
10.1007/978-3-031-91092-0_1

Related papers

Multi-key Homomorphic Secret Sharing from LWE Without Multi-key HE

Peiying Xu, Li-Ping Wang

Lecture notes in computer science•Jan 1, 2023•8 citations

Client-Server Homomorphic Secret Sharing in the CRS Model

Damiano Abram, Geoffroy Couteau, Lalita Devadas +4 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Multiparty Homomorphic Secret Sharing and More from LPN and MQ

Geoffroy Couteau, Naman Kumar, Xiangtao Ye

Lecture notes in computer science•Dec 1, 2025•7 citations

On group-characterizability of homomorphic secret sharing schemes

Reza Kaboli, Shahram Khazaei, Maghsoud Parviz

Theoretical Computer Science•Sep 1, 2021•5 citations

Thresholdizing lattice based encryption schemes

Andrew. Xia

In this thesis, we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold multi-key fully homomorphic encryption and predicate encryption. Through multi-key fully homomorphic encryption [MW16] and threshold fully homomorphic encryption, we can construct a low-round multi party computation (MPC) scheme with guaranteed output delivery, assuming honest majority in the semi-honest and malicious settings. Applying the secret sharing scheme on predicate encryption constructions from LWE [GVW15], we can obtain a distributed predicate encryption scheme.

•Jan 1, 2018•1 citation

Multi-Secret Sharing Schemes

Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo +2 more

Lecture notes in computer science•Jan 1, 1994•104 citations
In this thesis, we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold multi-key fully homomorphic encryption and predicate encryption. Through multi-key fully homomorphic encryption [MW16] and threshold fully homomorphic encryption, we can construct a low-round multi party computation (MPC) scheme with guaranteed output delivery, assuming honest majority in the semi-honest and malicious settings. Applying the secret sharing scheme on predicate encryption constructions from LWE [GVW15], we can obtain a distributed predicate encryption scheme.