Asynchronous secure computations with optimal resilience (extended abstract)
From MaRDI portal
Cited in
(43)- Robust random number generation for peer-to-peer systems
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- 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
- MPC with synchronous security and asynchronous responsiveness
- 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
- Constant-round asynchronous multi-party computation based on one-way functions
- Asynchronous Multi-Party Computation with Quadratic Communication
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Cryptography and cryptographic protocols
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Batch secret sharing for secure multi-party computation in asynchronous network
- \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
- Secure message transmission in asynchronous networks
- Security in Asynchronous Interactive Systems
- Network agnostic MPC with statistical security
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
- Network-agnostic multi-party computation revisited (extended abstract)
- Perfect asynchronous MPC with linear communication overhead
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Peeking into the future: MPC resilient to super-rushing adversaries
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
- Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents
- Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- Fast and efficient perfectly secure network-agnostic secure computation
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
This page was built for publication: Asynchronous secure computations with optimal resilience (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361409)
