A note on the communication complexity of multiparty computation in the correlated randomness model
From MaRDI portal
Publication:2292882
DOI10.1007/978-3-030-17656-3_17OpenAlexW2810615277MaRDI QIDQ2292882
Publication date: 6 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_17
information-theoretic securitymultiparty computationsublinear communicationcorrelated randomness model
Cryptography (94A60) Communication theory (94A05) Computer system organization (68Mxx) Theory of data (68Pxx)
Related Items (14)
On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Secure computation with preprocessing via function secret sharing ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Programmable distributed point functions ⋮ Sublinear secure computation from new assumptions ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ A geometric approach to homomorphic secret sharing ⋮ Efficient pseudorandom correlation generators from ring-LPN
This page was built for publication: A note on the communication complexity of multiparty computation in the correlated randomness model
