Homomorphic secret sharing from lattices without FHE
From MaRDI portal
Publication:2292864
DOI10.1007/978-3-030-17656-3_1zbMath1428.94103OpenAlexW2934305357MaRDI QIDQ2292864
Elette Boyle, Lisa Kohl, Peter Scholl
Publication date: 6 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_1
Related Items (26)
Evolving homomorphic secret sharing for hierarchical access structures ⋮ Large message homomorphic secret sharing from DCR and applications ⋮ Highly efficient OT-based multiplication protocols ⋮ CPA-to-CCA transformation for KDM security ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Verifiable decryption in the head ⋮ Sublinear secure computation from new assumptions ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Multi-secret sharing model based on Hermite interpolation polynomial and quantum graph state ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Circular security is complete for KDM security ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ A geometric approach to homomorphic secret sharing ⋮ Efficient pseudorandom correlation generators from ring-LPN
This page was built for publication: Homomorphic secret sharing from lattices without FHE
