Legally-Enforceable Fairness in Secure Two-Party Computation
From MaRDI portal
Publication:5458936
DOI10.1007/978-3-540-79263-5_8zbMATH Open1153.94407OpenAlexW1798352549MaRDI QIDQ5458936FDOQ5458936
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
Recommendations
Cites Work
- Security and composition of multiparty cryptographic protocols
- Title not available (Why is that?)
- Foundations of Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Complete fairness in secure two-party computation
- Theory of Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Secure multi-party computation without agreement
- On the composition of authenticated Byzantine Agreement
Cited In (10)
- On complete primitives for fairness
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Constant-round linear-broadcast secure computation with penalties
- Coin-based multi-party fair exchange
- Secure two-party computation with fairness -- a necessary design principle
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Financial Cryptography and Data Security
- Legally Fair Contract Signing Without Keystones
- Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin
- Constant-deposit multiparty lotteries on Bitcoin for arbitrary number of players and winners
This page was built for publication: Legally-Enforceable Fairness in Secure Two-Party Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458936)
