Communication Locality in Secure Multi-party Computation
From MaRDI portal
Publication:4910288
DOI10.1007/978-3-642-36594-2_21zbMath1315.94063OpenAlexW97265488MaRDI QIDQ4910288
Shafi Goldwasser, Stefano Tessaro, Elette Boyle
Publication date: 18 March 2013
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_21
Related Items
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs, Secure Multi-party Shuffling, Secure multi-party computation in large networks, On the Bottleneck Complexity of MPC with Correlated Randomness, Is information-theoretic topology-hiding computation possible?, Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party, Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs, Unnamed Item, Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?, High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom, Must the communication graph of MPC protocols be an expander?, From fairness to full security in multiparty computation, The more the merrier: reducing the cost of large scale MPC, Network-Hiding Communication and Applications to Multi-party Protocols, Network Oblivious Transfer, Spreading the privacy blanket: differentially oblivious shuffling for differential privacy, Three-party quantum summation without a trusted third party
