The following pages link to (Q3549592):
Displaying 18 items.
- An optimally fair coin toss (Q315542) (← links)
- Partial fairness in secure two-party computation (Q421046) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- Quantum secure two-party Euclidean distance computation based on mutually unbiased bases (Q2101544) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Synchronizable fair exchange (Q6581797) (← links)
- Three party secure computation with friends and foes (Q6582170) (← links)
- Threshold-optimal MPC with friends and foes (Q6623341) (← links)
- Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort (Q6637565) (← links)
