Pages that link to "Item:Q5395668"
From MaRDI portal
The following pages link to Complete Fairness in Secure Two-Party Computation (Q5395668):
Displaying 19 items.
- Completeness in two-party secure computation: A computational view (Q862422) (← links)
- Secure two-party computation with fairness -- a necessary design principle (Q1690208) (← links)
- Quantum secure two-party computation for set intersection with rational players (Q1993844) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← 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)
- Server-aided private set intersection based on reputation (Q2293036) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions (Q5261630) (← links)
- Progress in Cryptology - INDOCRYPT 2004 (Q5712208) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- Synchronizable fair exchange (Q6581797) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Just how fair is an unreactive world? (Q6605334) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
