Asynchronous secure computation

DOI10.1145/167088.167109zbMath1310.68044OpenAlexW2011665720MaRDI QIDQ5248471

Oded Goldreich, Ran Canetti, Michael Ben-Or

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167109

Mathematics Subject Classification ID

Related Items (28)

High-threshold AVSS with optimal communication complexity ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Revisiting asynchronous fault tolerant computation with optimal resilience ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Secure multi-party computation in large networks ⋮ Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Secure message transmission in asynchronous networks ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ Cryptography and cryptographic protocols ⋮ Reducing communication costs in robust peer-to-peer networks ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Topology-hiding computation for networks with unknown delays ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback

This page was built for publication: Asynchronous secure computation