Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
From MaRDI portal
Publication:5361463
DOI10.1145/259380.259412zbMath1374.68070OpenAlexW2052193425MaRDI QIDQ5361463
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/259380.259412
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (21)
Resilient uniformity: applying resiliency in masking ⋮ Oblivious transfer in incomplete networks ⋮ Broadcast from Minicast Secure Against General Adversaries ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Reliable broadcast with respect to topology knowledge ⋮ Graph coloring applied to secure computation in non-abelian groups ⋮ Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity ⋮ How to deal with malicious users in privacy‐preserving distributed data mining ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures ⋮ Recursive hiding of biometrics-based secret sharing scheme using adversary structure ⋮ Threshold protocols in survivor set systems ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Multi-party computation with conversion of secret sharing ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Player-Centric Byzantine Agreement ⋮ Secure multi-party computation made simple ⋮ MPC vs. SFE : Unconditional and Computational Security ⋮ Refined quorum systems ⋮ Byzantine Agreement Using Partial Authentication
This page was built for publication: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)