Secure multi-party computation in large networks
From MaRDI portal
Publication:2401120
DOI10.1007/s00446-016-0284-9zbMath1409.68041arXiv1203.0289OpenAlexW2405322972MaRDI QIDQ2401120
Mahdi Zamani, Valerie King, Jared Saia, Varsha Dani, Mahnush Movahedi
Publication date: 31 August 2017
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.0289
Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (4)
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Must the communication graph of MPC protocols be an expander? ⋮ From fairness to full security in multiparty computation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Fast perfect-information leader-election protocols with linear immunity
- Security and composition of multiparty cryptographic protocols
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- (Leveled) fully homomorphic encryption without bootstrapping
- How to Run Turing Machines on Encrypted Data
- How to share a secret
- Information-Theoretically Secure Protocols and Security under Composition
- Polynomial Codes Over Certain Finite Fields
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Secure Multi-party Shuffling
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Scalable leader election
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- Asynchronous Multiparty Computation: Theory and Implementation
- Secure Multiparty Computation Goes Live
- Fault Tolerance in Networks of Bounded Degree
- Foundations of Cryptography
- Software protection and simulation on oblivious RAMs
- Foundations of Cryptography
- Communication Locality in Secure Multi-party Computation
- Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms
- Resilient-optimal interactive consistency in constant time
- Fully homomorphic encryption using ideal lattices
- Fast byzantine agreement
- Asynchronous secure computation
- Probability and Computing
- Scalable Secure Multiparty Computation
- Brief announcement
This page was built for publication: Secure multi-party computation in large networks
