Homomorphic secret sharing from lattices without FHE
From MaRDI portal
Publication:2292864
DOI10.1007/978-3-030-17656-3_1zbMATH Open1428.94103OpenAlexW2934305357MaRDI QIDQ2292864FDOQ2292864
Authors: 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
Recommendations
- On homomorphic secret sharing from polynomial-modulus LWE
- Homomorphic secret sharing from Paillier encryption
- Verifiable homomorphic secret sharing
- Foundations of homomorphic secret sharing
- Homomorphic secret sharing for low degree polynomials
- Homomorphic extensions of CRT-based secret sharing
- Password protected secret sharing from lattices
- On ideal homomorphic secret sharing schemes and their decomposition
- scientific article; zbMATH DE number 4039795
Cited In (34)
- On homomorphic secret sharing from polynomial-modulus LWE
- Non-interactive secure computation of inner-product from LPN and LWE
- 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
- Large message homomorphic secret sharing from DCR and applications
- Function secret sharing for mixed-mode and fixed-point secure computation
- LERNA: secure single-server aggregation via key-homomorphic masking
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Sublinear-communication secure multiparty computation does not require FHE
- Foundations of homomorphic secret sharing
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Sublinear secure computation from new assumptions
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- An algebraic framework for silent preprocessing with trustless setup and active security
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Highly efficient OT-based multiplication protocols
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Succinct homomorphic secret sharing
- Efficient pseudorandom correlation generators from ring-LPN
- A geometric approach to homomorphic secret sharing
- CPA-to-CCA transformation for KDM security
- Constrained pseudorandom functions from homomorphic secret sharing
- 10-party sublinear secure computation from standard assumptions
- Compressing unit-vector correlations via sparse pseudorandom generators
- Verifiable decryption in the head
- Circular security is complete for KDM security
- Evolving homomorphic secret sharing for hierarchical access structures
- Multi-key homomorphic secret sharing from LWE without multi-key HE
- On the local leakage resilience of linear secret sharing schemes
This page was built for publication: Homomorphic secret sharing from lattices without FHE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292864)
