Pages that link to "Item:Q2953803"
From MaRDI portal
The following pages link to Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803):
Displaying 20 items.
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation (Q2152067) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Quantum multi-party fair exchange protocol based on three-particle GHZ states (Q6072540) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Bitcoin as a Transaction Ledger: A Composable Treatment (Q6489334) (← links)
- Robust privacy-preserving gossip averaging (Q6536326) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Network-agnostic multi-party computation revisited (extended abstract) (Q6635768) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
- Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035) (← links)
