Multi-key homomorphic secret sharing

DOI10.1007/978-3-031-91092-0_1MaRDI QIDQ6891264zbMATH OpenFDO

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

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91092-0_1

zbMATH Keywords

fully homomorphic encryptionpublic-key PCFssilent MPCsuccinct two-round secure computation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• 10-party sublinear secure computation from standard assumptions
• A note on the communication complexity of multiparty computation in the correlated randomness model
• An algebraic framework for silent preprocessing with trustless setup and active security
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Breaking the circuit size barrier for secure computation under DDH
• Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
• Circular-Secure Encryption from Decision Diffie-Hellman
• Constrained pseudorandom functions from homomorphic secret sharing
• Correlated pseudorandom functions from variable-density LPN
• Correlated pseudorandomness from the hardness of quasi-abelian decoding
• Distributed Point Functions and Their Applications
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient pseudorandom correlation generators: silent OT extension and more
• Fast public-key silent OT and more from constrained Naor-Reingold
• FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
• Fully homomorphic encryption using ideal lattices
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Homomorphic secret sharing from lattices without FHE
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 1030984 (Why is no real title available?)
• Large message homomorphic secret sharing from DCR and applications
• Mr NISC: multiparty reusable non-interactive secure computation
• Multi-key FHE from LWE, revisited
• Multi-key fully-homomorphic encryption in the plain model
• Multi-key homomorphic secret sharing
• Multi-key homomorphic secret sharing from LWE without multi-key HE
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Multiparty reusable non-interactive secure computation from LWE
• New directions in cryptography
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• QuietOT: lightweight oblivious transfer with a public-key setup
• Reusable two-round MPC from DDH
• Secure computation on the web: computing without simultaneous interaction
• Spooky Encryption and Its Applications
• Sublinear-communication secure multiparty computation does not require FHE
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Two round multiparty computation via multi-key FHE
• Unbounded multi-party computation from learning with errors

Cited in

(5)

• Multi-key homomorphic secret sharing
• Non-interactive distributed point functions
• Threshold homomorphic secret sharing: definitions and constructions
• Pseudorandom correlation functions from Ring-LWR
• Client-server homomorphic secret sharing in the CRS model

This page was built for publication: Multi-key homomorphic secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891264)