Multi-key homomorphic secret sharing from LWE without multi-key HE

DOI10.1007/978-3-031-35486-1_12MaRDI QIDQ6535488zbMATH OpenFDO

Authors Peiying Xu, Liping Wang

Publication date 11 January 2024

Full work available at URL https://doi.org/10.1007/978-3-031-35486-1_12

zbMATH Keywords

learning with errorshomomorphic secret sharinghomomorphic linear combinationnearly linear decryption

Mathematics Subject Classification ID

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

Recommendations

• Homomorphic secret sharing from lattices without FHE
• Homomorphic secret sharing for low degree polynomials
• On homomorphic secret sharing from polynomial-modulus LWE
• A geometric approach to homomorphic secret sharing
• Verifiable homomorphic secret sharing

Cites work

• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1559546 (Why is no real title available?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A toolkit for ring-LWE cryptography
• Breaking the circuit size barrier for secure computation under DDH
• Distributed Point Functions and Their Applications
• Fully homomorphic encryption using ideal lattices
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
• Homomorphic secret sharing from Paillier encryption
• Homomorphic secret sharing from lattices without FHE
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On lattices, learning with errors, random linear codes, and cryptography
• Spooky Encryption and Its Applications
• Sum it up: verifiable additive homomorphic secret sharing
• Towards optimal simulations of formulas by bounded-width programs
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Two round multiparty computation via multi-key FHE
• Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
• Verifiable homomorphic secret sharing

Cited in

(3)

• Non-interactive distributed point functions
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• Multi-key homomorphic secret sharing

This page was built for publication: Multi-key homomorphic secret sharing from LWE without multi-key HE

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