Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
From MaRDI portal
Publication:6186715
DOI10.1007/978-3-031-38545-2_11OpenAlexW4385654331MaRDI QIDQ6186715
Huijia Lin, Yuval Ishai, Aayush Jain, Quang Dao
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_11
Cites Work
- Unnamed Item
- Unnamed Item
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Homomorphic secret sharing from Paillier encryption
- Threshold cryptosystems from threshold fully homomorphic encryption
- Secure arithmetic computation with constant computational overhead
- Homomorphic secret sharing for low degree polynomials
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- A geometric approach to homomorphic secret sharing
- Large message homomorphic secret sharing from DCR and applications
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- Homomorphic secret sharing from lattices without FHE
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Efficient pseudorandom correlation generators: silent OT extension and more
- (Leveled) fully homomorphic encryption without bootstrapping
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Public-key cryptography from different assumptions
- Fully Homomorphic Encryption with Polylog Overhead
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Function Secret Sharing
- Candidate One-Way Functions Based on Expander Graphs
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Relations between average case complexity and approximation complexity
- On Pseudorandom Generators with Linear Stretch in NC0
- Circular-Secure Encryption from Decision Diffie-Hellman
- Sum of squares lower bounds for refuting any CSP
- Foundations of Homomorphic Secret Sharing
- Fully homomorphic encryption using ideal lattices
- Communication preserving protocols for secure function evaluation
- Algebraic attacks against random local functions and their countermeasures
- Distributed Point Functions and Their Applications
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Universally Composable Oblivious Transfer Based on a Variant of LPN
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Two Round Multiparty Computation via Multi-key FHE
- Sublinear-communication secure multiparty computation does not require FHE
- Indistinguishability obfuscation from well-founded assumptions
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- An algebraic framework for silent preprocessing with trustless setup and active security
This page was built for publication: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
