Legally-Enforceable Fairness in Secure Two-Party Computation
From MaRDI portal
(Redirected from Publication:5458936)
Recommendations
Cites work
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2009950 (Why is no real title available?)
- scientific article; zbMATH DE number 1759773 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Complete fairness in secure two-party computation
- Foundations of Cryptography
- On the composition of authenticated Byzantine Agreement
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Theory of Cryptography
Cited in
(15)- On complete primitives for fairness
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Coin-based multi-party fair exchange
- Secure two-party computation with fairness -- a necessary design principle
- Constant-round linear-broadcast secure computation with penalties
- Legally enforceable fairness in secure two-party communication
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Financial Cryptography and Data Security
- Legally Fair Contract Signing Without Keystones
- How to use bitcoin to design fair protocols
- Fairness versus guaranteed output delivery in secure multiparty computation
- Fairness versus guaranteed output delivery in secure multiparty computation
- Secure computation with penalties, revisited: how to handle coins with various colors
- Constant-deposit multiparty lotteries on Bitcoin for arbitrary number of players and winners
- Escrow protocols for cryptocurrencies: how to buy physical goods using Bitcoin
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)