Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
type: Item
instance of: scholarly article
title: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
DOI: 10.1007/978-3-030-77886-6_29
author: Geoffroy Couteau
author: Pierre-Jean Meyer
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440629
zbMATH Keywords: homomorphic secret sharing
zbMATH Keywords: multiparty computation
zbMATH Keywords: sublinear communication
zbMATH Keywords: learning parity with noise
zbMATH Keywords: pseudorandom correlation generators
MaRDI profile type: Publication
full work available at URL: 978-3-030-77886-6 29
OpenAlex ID: W3166503321
cites work: Q4638056
cites work: Cryptography with Constant Input Locality
cites work: Cryptography with constant input locality
cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
cites work: Efficient pseudorandom correlation generators: silent OT extension and more
cites work: Efficient pseudorandom correlation generators from ring-LPN
cites work: Q4341754
cites work: Q4279564
cites work: Function Secret Sharing
cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH
cites work: Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
cites work: Homomorphic secret sharing from lattices without FHE
cites work: Noise-tolerant learning, the parity problem, and the statistical query model
cites work: Worst-case hardness for LPN and cryptographic hashing via code smoothing
cites work: Q4526995
cites work: Q4231909
cites work: A note on the communication complexity of multiparty computation in the correlated randomness model
cites work: Secure Two-Party Computation with Low Communication
cites work: Two-round oblivious transfer from CDH or LPN
cites work: Homomorphic secret sharing from Paillier encryption
cites work: Fully homomorphic encryption using ideal lattices
cites work: Distributed Point Functions and Their Applications
cites work: Q3777937
cites work: On the Power of Correlated Randomness in Secure Computation
cites work: Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: Communication preserving protocols for secure function evaluation
cites work: A Permutation Network
cites work: Collision resistant hashing from sub-exponential learning parity with noise
description: scientific article; zbMATH DE number 7440629