Legally-Enforceable Fairness in Secure Two-Party Computation

DOI10.1007/978-3-540-79263-5_8zbMath1153.94407OpenAlexW1798352549MaRDI QIDQ5458936

Andrew Y. Lindell

Publication date: 24 April 2008

Published in: Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Constant-round linear-broadcast secure computation with penalties ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Legally Fair Contract Signing Without Keystones ⋮ On Complete Primitives for Fairness ⋮ Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin ⋮ Coin-based multi-party fair exchange

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security and composition of multiparty cryptographic protocols
• Secure multi-party computation without agreement
• On the composition of authenticated Byzantine Agreement
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography

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