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

DOI10.1007/978-3-030-77886-6_29MaRDI QIDQ2056771OpenAlexFDO

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

zbMATH Keywords

multiparty computationhomomorphic secret sharingsublinear communicationlearning parity with noisepseudorandom correlation generators

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• scientific article; zbMATH DE number 503242 (Why is no real title available?)
• scientific article; zbMATH DE number 1024063 (Why is no real title available?)
• scientific article; zbMATH DE number 1559546 (Why is no real title available?)
• A Permutation Network
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Breaking the circuit size barrier for secure computation under DDH
• Collision resistant hashing from sub-exponential learning parity with noise
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• Communication preserving protocols for secure function evaluation
• Cryptography with Constant Input Locality
• Cryptography with constant input locality
• Distributed Point Functions and Their Applications
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient pseudorandom correlation generators: silent OT extension and more
• Fully homomorphic encryption using ideal lattices
• Function secret sharing
• Homomorphic secret sharing from Paillier encryption
• Homomorphic secret sharing from lattices without FHE
• Low-complexity cryptographic hash functions
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Noise-tolerant learning, the parity problem, and the statistical query model
• Noise-tolerant learning, the parity problem, and the statistical query model
• On the power of correlated randomness in secure computation
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Secure two-party computation with low communication
• Two-round oblivious transfer from CDH or LPN
• Worst-case hardness for LPN and cryptographic hashing via code smoothing

Cited in

(7)

• Sublinear secure computation from new assumptions
• Sublinear-communication secure multiparty computation does not require FHE
• 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
• On homomorphic secret sharing from polynomial-modulus LWE
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)

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)