Pages that link to "Item:Q1698398"
From MaRDI portal
The following pages link to Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398):
Displaying 16 items.
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Multiparty generation of an RSA modulus (Q5918574) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Multiparty generation of an RSA modulus (Q5970801) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Fair delivery of decentralised randomness beacon (Q6573966) (← links)
- Synchronizable fair exchange (Q6581797) (← links)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- Just how fair is an unreactive world? (Q6605334) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
