Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
From MaRDI portal
Publication:2953803
DOI10.1007/978-3-662-53890-6_33zbMath1407.94098OpenAlexW2549715468MaRDI QIDQ2953803
Juan A. Garay, Martin Hirt, Vassilis Zikas, Sandro Coretti
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_33
Related Items
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), 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, Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions, 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, 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, Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era, Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
Cites Work
- Unnamed Item
- A lower bound for the time to assure interactive consistency
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Asynchronous Secure Multiparty Computation in Constant Time
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- Authenticated Algorithms for Byzantine Agreement
- How to share a secret
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Asynchronous Multi-Party Computation with Quadratic Communication
- Adaptively Secure Broadcast
- Impossibility of distributed consensus with one faulty process
- Foundations of Cryptography
- Universally Composable Synchronous Computation
- Fast asynchronous Byzantine agreement with optimal resilience
- Asynchronous secure computation
- Circuits resilient to additive attacks with applications to secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Theory of Cryptography
- On Expected Constant-Round Protocols for Byzantine Agreement
