Synchronizable fair exchange

DOI10.1007/978-3-031-48615-9_15MaRDI QIDQ6581797zbMATH OpenFDO

Authors Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon

Publication date 1 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48615-9_15

zbMATH Keywords

completenessfair exchangepreprocessingsecure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Just how fair is an unreactive world?
• On complete primitives for fairness
• Complete fairness in secure two-party computation
• Complete fairness in secure two-party computation
• Complete Fairness in Multi-party Computation without an Honest Majority

Cites work

• Authenticated Algorithms for Byzantine Agreement
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Complete Fairness in Multi-party Computation without an Honest Majority
• Complete fairness in secure two-party computation
• Completely fair SFE and coalition-safe cheap talk
• Fairness versus guaranteed output delivery in secure multiparty computation
• Financial cryptography and data security. FC 2014 workshops, BITCOIN and WAHC 2014, Christ Church, Barbados, March 7, 2014. Revised selected papers
• Formal abstractions for attested execution secure processors
• How to use bitcoin to design fair protocols
• scientific article; zbMATH DE number 5485432 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 2009950 (Why is no real title available?)
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Minimal complete primitives for secure multi-party computation
• On complete primitives for fairness
• Partial fairness in secure two-party computation
• Resource fairness and composability of cryptographic protocols
• Theory of Cryptography
• Timed fair exchange of standard signatures (extended abstract)
• Timed release of standard digital signatures (extended abstract)
• Towards characterizing complete fairness in secure two-party computation
• Universally composable two-party and multi-party secure computation

Cited in

(1)

• Just how fair is an unreactive world?

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)