Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
DOI10.1007/978-3-030-77886-6_29OpenAlexW3166503321MaRDI QIDQ2056771FDOQ2056771
Authors: Geoffroy Couteau, Pierre-Jean Meyer 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_29
multiparty computationhomomorphic secret sharingsublinear communicationlearning parity with noisepseudorandom correlation generators
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Fully homomorphic encryption using ideal lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Noise-tolerant learning, the parity problem, and the statistical query model
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Cryptography with constant input locality
- Noise-tolerant learning, the parity problem, and the statistical query model
- Secure two-party computation with low communication
- Communication preserving protocols for secure function evaluation
- Title not available (Why is that?)
- A Permutation Network
- Title not available (Why is that?)
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
- Cryptography with Constant Input Locality
- Title not available (Why is that?)
- On the power of correlated randomness in secure computation
- Homomorphic secret sharing from Paillier encryption
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Function Secret Sharing
- Distributed Point Functions and Their Applications
- Collision resistant hashing from sub-exponential learning parity with noise
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Efficient pseudorandom correlation generators from ring-LPN
- Two-round oblivious transfer from CDH or LPN
- Homomorphic secret sharing from lattices without FHE
- Efficient pseudorandom correlation generators: silent OT extension and more
- Title not available (Why is that?)
Cited In (7)
- On homomorphic secret sharing from polynomial-modulus LWE
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Sublinear-communication secure multiparty computation does not require FHE
- Sublinear secure computation from new assumptions
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- 10-party sublinear secure computation from standard assumptions
- Compressing unit-vector correlations via sparse pseudorandom generators
This page was built for publication: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056771)
