Pages that link to "Item:Q5261630"
From MaRDI portal
The following pages link to Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions (Q5261630):
Displaying 23 items.
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← 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)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Synchronizable fair exchange (Q6581797) (← links)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Three party secure computation with friends and foes (Q6582170) (← links)
- Just how fair is an unreactive world? (Q6605334) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
- Can Alice and Bob guarantee output to Carol? (Q6637537) (← links)
