Multi-key homomorphic secret sharing from LWE without multi-key HE
From MaRDI portal
Publication:6535488
DOI10.1007/978-3-031-35486-1_12zbMATH Open1543.94795MaRDI QIDQ6535488FDOQ6535488
Authors: Peiying Xu, Liping Wang 
Publication date: 11 January 2024
learning with errorshomomorphic secret sharinghomomorphic linear combinationnearly linear decryption
Cites Work
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Title not available (Why is that?)
- Towards optimal simulations of formulas by bounded-width programs
- A toolkit for ring-LWE cryptography
- Sum it up: verifiable additive homomorphic secret sharing
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Verifiable homomorphic secret sharing
- Homomorphic secret sharing from Paillier encryption
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Two Round Multiparty Computation via Multi-key FHE
- Distributed Point Functions and Their Applications
- Homomorphic secret sharing from lattices without FHE
- Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
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)
