Constant-round asynchronous multi-party computation based on one-way functions
From MaRDI portal
Recommendations
- Asynchronous secure multiparty computation in constant time
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Secure multi-party computation in large networks
- Asynchronous Multiparty Computation: Theory and Implementation
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
Cites work
- A lower bound for the time to assure interactive consistency
- Adaptively secure broadcast
- Asynchronous Multi-Party Computation with Quadratic Communication
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Asynchronous secure multiparty computation in constant time
- Authenticated Algorithms for Byzantine Agreement
- Circuits resilient to additive attacks with applications to secure computation
- Constant-round asynchronous multi-party computation based on one-way functions
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- Foundations of Cryptography
- How to share a secret
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- On Expected Constant-Round Protocols for Byzantine Agreement
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Theory of Cryptography
- Universally composable synchronous computation
Cited in
(28)- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- 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)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- 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
- Asynchronous secure multiparty computation in constant time
- Constant-round asynchronous multi-party computation based on one-way functions
- On the theoretical gap between synchronous and asynchronous MPC protocols
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Quantum multi-party fair exchange protocol based on three-particle GHZ states
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
- Bitcoin as a Transaction Ledger: A Composable Treatment
- Robust privacy-preserving gossip averaging
- 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)
- Asymmetric multi-party computation
- 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
- Peeking into the future: MPC resilient to super-rushing adversaries
- Is it even possible? On the parallel composition of asynchronous MPC protocols
This page was built for publication: Constant-round asynchronous multi-party computation based on one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953803)
