Partial Fairness in Secure Two-Party Computation

DOI10.1007/978-3-642-13190-5_8zbMath1279.94078OpenAlexW1481198657MaRDI QIDQ3563834

S. Dov Gordon, Jonathan N. Katz

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Partial fairness in secure two-party computation ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Resource fairness and composability of cryptographic protocols ⋮ What security can we achieve within 4 rounds? ⋮ From fairness to full security in multiparty computation ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness

This page was built for publication: Partial Fairness in Secure Two-Party Computation