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

DOI10.1007/978-3-031-35486-1_12zbMath1543.94795MaRDI QIDQ6535488

Li-Ping Wang, Peiying Xu

Publication date: 11 January 2024

zbMATH Keywords

learning with errorshomomorphic secret sharinghomomorphic linear combinationnearly linear decryption

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Towards optimal simulations of formulas by bounded-width programs
• Sum it up: verifiable additive homomorphic secret sharing
• Verifiable homomorphic secret sharing
• Homomorphic secret sharing from Paillier encryption
• Homomorphic secret sharing from lattices without FHE
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Toolkit for Ring-LWE Cryptography
• Fully homomorphic encryption using ideal lattices
• Distributed Point Functions and Their Applications
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Two Round Multiparty Computation via Multi-key FHE
• On lattices, learning with errors, random linear codes, and cryptography
• Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
• Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials

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