The following pages link to (Q3549726):
Displaying 34 items.
- An optimally fair coin toss (Q315542) (← links)
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Partial fairness in secure two-party computation (Q421046) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Completeness in two-party secure computation: A computational view (Q862422) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- On the structure of unconditional UC hybrid protocols (Q1631320) (← links)
- Secure two-party computation with fairness -- a necessary design principle (Q1690208) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Quantum secure two-party computation for set intersection with rational players (Q1993844) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Quantum secure two-party Euclidean distance computation based on mutually unbiased bases (Q2101544) (← links)
- Quantum verifiable protocol for secure modulo zero-sum randomness (Q2101598) (← 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)
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
- Legally Fair Contract Signing Without Keystones (Q2822672) (← 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)
- Efficient Rational Secret Sharing in Standard Communication Networks (Q3408208) (← links)
- Fair Threshold Decryption with Semi-Trusted Third Parties (Q3634502) (← links)
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions (Q5261630) (← links)
- Legally-Enforceable Fairness in Secure Two-Party Computation (Q5458936) (← links)
- Progress in Cryptology - INDOCRYPT 2004 (Q5712208) (← 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)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- Three party secure computation with friends and foes (Q6582170) (← 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)
