Synchronizable fair exchange
From MaRDI portal
Publication:6581797
DOI10.1007/978-3-031-48615-9_15zbMATH Open1544.9426MaRDI QIDQ6581797
Adam Sealfon, Srinivasan Raghuraman, Ranjit Kumaresan
Publication date: 1 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resource fairness and composability of cryptographic protocols
- Fairness versus guaranteed output delivery in secure multiparty computation
- Minimal complete primitives for secure multi-party computation
- Financial cryptography and data security. FC 2014 workshops, BITCOIN and WAHC 2014, Christ Church, Barbados, March 7, 2014. Revised selected papers
- How to Use Bitcoin to Design Fair Protocols
- Timed Release of Standard Digital Signatures
- Authenticated Algorithms for Byzantine Agreement
- On Complete Primitives for Fairness
- Partial Fairness in Secure Two-Party Computation
- Universally composable two-party and multi-party secure computation
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Secure Two-Party Computation
- Completely fair SFE and coalition-safe cheap talk
- Theory of Cryptography
- Formal Abstractions for Attested Execution Secure Processors
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- Computer Aided Verification
This page was built for publication: Synchronizable fair exchange
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581797)
