Breaking the circuit size barrier for secure computation under quasi-polynomial LPN

DOI10.1007/978-3-030-77886-6_29OpenAlexW3166503321MaRDI QIDQ2056771

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

zbMATH Keywords

learning parity with noisemultiparty computationhomomorphic secret sharingsublinear communicationpseudorandom correlation generators

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Sublinear secure computation from new assumptions ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptography with constant input locality
• Homomorphic secret sharing from Paillier encryption
• Efficient pseudorandom correlation generators from ring-LPN
• Two-round oblivious transfer from CDH or LPN
• Collision resistant hashing from sub-exponential learning parity with noise
• 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
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Secure Two-Party Computation with Low Communication
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Function Secret Sharing
• Cryptography with Constant Input Locality
• On the Power of Correlated Randomness in Secure Computation
• Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
• Fully homomorphic encryption using ideal lattices
• Communication preserving protocols for secure function evaluation
• Distributed Point Functions and Their Applications
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• A Permutation Network
• Noise-tolerant learning, the parity problem, and the statistical query model
• Noise-tolerant learning, the parity problem, and the statistical query model