Asynchronous secure computations with optimal resilience (extended abstract)

DOI10.1145/197917.198088zbMath1373.68074OpenAlexW2025142762MaRDI QIDQ5361409

Tal Rabin, Michael Ben-Or, Boaz Kelmer

Publication date: 29 September 2017

Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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)

Related Items (25)

Clairvoyant state machine replication ⋮ 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) ⋮ Revisiting asynchronous fault tolerant computation with optimal resilience ⋮ Batch secret sharing for secure multi-party computation in asynchronous network ⋮ 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 ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On the Validity of Consensus ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Secure message transmission in asynchronous networks ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Cryptography and cryptographic protocols ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Robust random number generation for peer-to-peer systems ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback

This page was built for publication: Asynchronous secure computations with optimal resilience (extended abstract)