Succinct homomorphic secret sharing

DOI10.1007/978-3-031-58751-1_11MaRDI QIDQ6637573zbMATH OpenFDO

Authors Damiano Abram, Lawrence Roy, Peter Scholl

Publication date 13 November 2024

zbMATH Keywords

learning with errorsBoolean circuitsbranching programs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Foundations of homomorphic secret sharing
• Homomorphic secret sharing from lattices without FHE
• On homomorphic secret sharing from polynomial-modulus LWE
• A geometric approach to homomorphic secret sharing
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN

Cites work

• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
• An algebraic framework for silent preprocessing with trustless setup and active security
• Breaking the circuit size barrier for secure computation under DDH
• Communication preserving protocols for secure function evaluation
• Efficient pseudorandom correlation generators: silent OT extension and more
• Efficient range-trapdoor functions and applications: rate-1 OT and more
• Homomorphic secret sharing from lattices without FHE
• Large message homomorphic secret sharing from DCR and applications
• Lattice-based succinct arguments from vanishing polynomials (extended abstract)
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• On the power of correlated randomness in secure computation
• Sublinear-communication secure multiparty computation does not require FHE
• Succinct homomorphic secret sharing
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Trapdoor hash functions and their applications
• Trapdoors for hard lattices and new cryptographic constructions
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions

Cited in

(4)

• On homomorphic secret sharing from polynomial-modulus LWE
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• Succinct homomorphic secret sharing

This page was built for publication: Succinct homomorphic secret sharing

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