Optimally-fair multi-party exchange without trusted parties
From MaRDI portal
Publication:6550628
DOI10.1007/978-3-031-50594-2_16MaRDI QIDQ6550628
Publication date: 5 June 2024
secure multi-party computationcommutative encryptionfair exchangetimed-release encryptionmulti-party fair exchangepartial fairness
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical and provably secure release of a secret and exchange of signatures
- Security and composition of multiparty cryptographic protocols
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Secure multi-party computation
- Flash mixing
- Partial Fairness in Secure Two-Party Computation
- Foundations of Cryptography
- Efficiently Making Secure Two-Party Computation Fair
- Fast Optimistically Fair Cut-and-Choose 2PC
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
This page was built for publication: Optimally-fair multi-party exchange without trusted parties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550628)
