On Complete Primitives for Fairness

DOI10.1007/978-3-642-11799-2_7zbMath1274.94071OpenAlexW1543619595MaRDI QIDQ3408189

Yuval Ishai, Rafail Ostrovsky, Tal Moran, Dov Gordon, Amit Sahai

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_7

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Fully-secure MPC with minimal trust ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ On actively-secure elementary MPC reductions ⋮ Algebraic manipulation detection codes ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Resource fairness and composability of cryptographic protocols ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ Coin-based multi-party fair exchange

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15--17, 2009. Proceedings
• On the structure of the privacy hierarchy
• Advances in cryptology - CRYPTO 2000. 20th annual international conference, Santa Barbara, CA, USA, August 20--24, 2000. Proceedings
• Minimal complete primitives for secure multi-party computation
• Practical and provably secure release of a secret and exchange of signatures
• Security and composition of multiparty cryptographic protocols
• Founding Cryptography on Oblivious Transfer – Efficiently
• Complete Fairness in Multi-party Computation without an Honest Majority
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• Optimistic fair exchange of digital signatures
• Reducibility and Completeness in Private Computations
• Advances in Cryptology - EUROCRYPT 2004
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Legally-Enforceable Fairness in Secure Two-Party Computation
• Completely fair SFE and coalition-safe cheap talk
• A Zero-One Law for Boolean Privacy
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: On Complete Primitives for Fairness