On complete primitives for fairness
From MaRDI portal
Recommendations
Cites work
- A Zero-One Law for Boolean Privacy
- Advances in cryptology - CRYPTO 2000. 20th annual international conference, Santa Barbara, CA, USA, August 20--24, 2000. Proceedings
- Advances in Cryptology - EUROCRYPT 2004
- 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
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Founding Cryptography on Oblivious Transfer – Efficiently
- scientific article; zbMATH DE number 4191105 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 5485432 (Why is no real title available?)
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 176512 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- 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?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 2086726 (Why is no real title available?)
- Legally-Enforceable Fairness in Secure Two-Party Computation
- Minimal complete primitives for secure multi-party computation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On the structure of the privacy hierarchy
- Optimistic fair exchange of digital signatures
- Practical and provably secure release of a secret and exchange of signatures
- Reducibility and Completeness in Private Computations
- Security and composition of multiparty cryptographic protocols
- Theory of Cryptography
- Theory of Cryptography
- Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15--17, 2009. Proceedings
Cited in
(17)- An introduction to the regular theory of fairness
- An efficient primal-dual algorithm for fair combinatorial optimization problems
- Coin-based multi-party fair exchange
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Algebraic manipulation detection codes
- On actively-secure elementary MPC reductions
- On Adaptively Secure Multiparty Computation with a Short CRS
- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
- On fairness of completion-based theorem proving strategies
- Fairness for Infinite-State Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Fully-secure MPC with minimal trust
- Astrolabous: a universally composable time-lock encryption scheme
- Resource fairness and composability of cryptographic protocols
- Synchronizable fair exchange
- Just how fair is an unreactive world?
- Secure computation with penalties, revisited: how to handle coins with various colors
This page was built for publication: On complete primitives for fairness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408189)
