Pages that link to "Item:Q3563834"

The following pages link to Partial Fairness in Secure Two-Party Computation (Q3563834):

Displaying 13 items.

• Partial fairness in secure two-party computation (Q421046) (← links)
• Resource fairness and composability of cryptographic protocols (Q656919) (← links)
• What security can we achieve within 4 rounds? (Q2010586) (← links)
• Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← 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)
• Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
• What Security Can We Achieve Within 4 Rounds? (Q2827735) (← 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)
• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)