Asynchronous secure computation
From MaRDI portal
Cited in
(51)- Efficient asynchronous verifiable secret sharing and multiparty computation
- Topology-hiding computation for networks with unknown delays
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- 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)
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Secure multi-party computation in large networks
- Optimal extension protocols for Byzantine broadcast and agreement
- Linear overhead optimally-resilient robust MPC using preprocessing
- Constant-round asynchronous multi-party computation based on one-way functions
- The cost of fault tolerance in multi-party communication complexity
- Asynchronous Multi-Party Computation with Quadratic Communication
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
- 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
- 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
- Security in Asynchronous Interactive Systems
- VSS Made Simpler
- From partial to global asynchronous reliable broadcast
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- 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)
- SPRINT: high-throughput robust distributed Schnorr signatures
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
- Bivariate proximity test-based asynchronous verifiable secret sharing
- Peeking into the future: MPC resilient to super-rushing adversaries
- Asymptotically free broadcast in constant expected time via packed VSS
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- 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
- Perfectly secure network-agnostic MPC comes for free
- Byzantine agreement and Byzantine broadcast
- Reducing communication costs in robust peer-to-peer networks
This page was built for publication: Asynchronous secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248471)
