scientific article

zbMath1231.94062MaRDI QIDQ3549726

Hazay Carmit, Yehuda Lindell, S. Dov Gordon, Jonathan N. Katz

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (26)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Incentive-driven attacker for corrupting two-party protocols ⋮ On the structure of unconditional UC hybrid protocols ⋮ An optimally fair coin toss ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Toward a game theoretic view of secure computation ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Partial fairness in secure two-party computation ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Resource fairness and composability of cryptographic protocols ⋮ Quantum secure two-party computation for set intersection with rational players ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ Legally-Enforceable Fairness in Secure Two-Party Computation ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Legally Fair Contract Signing Without Keystones ⋮ On Complete Primitives for Fairness ⋮ Efficient Rational Secret Sharing in Standard Communication Networks ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ MPC with friends and foes ⋮ Quantum secure two-party Euclidean distance computation based on mutually unbiased bases ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness

This page was built for publication: