Efficient general-adversary multi-party computation
From MaRDI portal
Publication:2867152
DOI10.1007/978-3-642-42045-0_10zbMATH Open1314.94073OpenAlexW111864789MaRDI QIDQ2867152FDOQ2867152
Authors: Martin Hirt, Daniel Tschudi 
Publication date: 10 December 2013
Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_10
Recommendations
- Communication-efficient MPC for general adversary structures
- Publication:4502503
- Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary
- Perfectly-Secure MPC with Linear Communication Complexity
- Player simulation and general adversary structures in perfect multiparty computation
Cited In (17)
- Multi-Party Computation with Omnipresent Adversary
- Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups
- Strong Separations Between Broadcast and Authenticated Channels
- Network agnostic MPC with statistical security
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Title not available (Why is that?)
- Communication-efficient MPC for general adversary structures
- On the (in)efficiency of non-interactive secure multiparty computation
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- Theory of Cryptography
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Broadcast from minicast secure against general adversaries
- On Adaptively Secure Multiparty Computation with a Short CRS
- Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary
- Perfectly-Secure MPC with Linear Communication Complexity
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
This page was built for publication: Efficient general-adversary multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867152)
