Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
From MaRDI portal
(Redirected from Publication:6186715)
Recommendations
- Succinct homomorphic secret sharing
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- Multi-key homomorphic secret sharing from LWE without multi-key HE
- A geometric approach to homomorphic secret sharing
- Homomorphic secret sharing from lattices without FHE
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A geometric approach to homomorphic secret sharing
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Algebraic attacks against random local functions and their countermeasures
- An algebraic framework for silent preprocessing with trustless setup and active security
- Breaking the circuit size barrier for secure computation under DDH
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Candidate one-way functions based on expander graphs
- Circular-Secure Encryption from Decision Diffie-Hellman
- Communication preserving protocols for secure function evaluation
- Cryptography with constant computational overhead
- Distributed Point Functions and Their Applications
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Foundations of homomorphic secret sharing
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Function secret sharing
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Homomorphic secret sharing for low degree polynomials
- Homomorphic secret sharing from lattices without FHE
- Homomorphic secret sharing from Paillier encryption
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- Indistinguishability obfuscation from well-founded assumptions
- Large message homomorphic secret sharing from DCR and applications
- Multi-identity and multi-key leveled FHE from learning with errors
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- On Pseudorandom Generators with Linear Stretch in NC0
- Public-key cryptography from different assumptions
- Relations between average case complexity and approximation complexity
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Secure arithmetic computation with constant computational overhead
- Spooky Encryption and Its Applications
- Sublinear-communication secure multiparty computation does not require FHE
- Sum of squares lower bounds for refuting any CSP
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Threshold cryptosystems from threshold fully homomorphic encryption
- Two round multiparty computation via multi-key FHE
- Universally composable oblivious transfer based on a variant of LPN
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
Cited in
(28)- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Succinct homomorphic secret sharing
- Lossy cryptography from code-based assumptions
- A systematic study of sparse LWE
- 10-party sublinear secure computation from standard assumptions
- Sample efficient search to decision for kLIN
- Improved trade-offs between amortization and download bandwidth for linear HSS
- Multi-key homomorphic secret sharing
- Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- A characterization of optimal-rate linear homomorphic secret sharing schemes, and applications
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Non-interactive distributed point functions
- Homomorphic secret sharing with verifiable evaluation
- A note on low-communication secure multiparty computation via circuit depth-reduction
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Succinct line-point zero-knowledge arguments from homomorphic secret sharing
- Threshold homomorphic secret sharing: definitions and constructions
- Fast pseudorandom correlation functions from sparse LPN
- Pseudorandom correlation generators for multiparty Beaver triples over \(\mathbb{F}_2\)
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
- Pseudorandom correlation functions for garbled circuits
- Multiparty homomorphic secret sharing and more from LPN and MQ
- Client-server homomorphic secret sharing in the CRS model
- Spectral refutations of semirandom k-LIN over larger fields
- Structured-seed local pseudorandom generators and their applications
- Multi-committee MPC: from unanimous to identifiable abort
- Malicious homomorphic secret sharing with applications to DV-NIZK and more
This page was built for publication: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186715)
