Complete fairness in secure two-party computation
From MaRDI portal
Recommendations
Cited in
(52)- Incentive-driven attacker for corrupting two-party protocols
- On the structure of unconditional UC hybrid protocols
- Secure two-party computation with fairness -- a necessary design principle
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Fairness versus guaranteed output delivery in secure multiparty computation
- Quantum secure two-party computation for set intersection with rational players
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- MPC with friends and foes
- Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
- Quantum verifiable protocol for secure modulo zero-sum randomness
- Computational hardness of optimal fair computation: beyond Minicrypt
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- Legally Fair Contract Signing Without Keystones
- On fair exchange, fair coins and fair sampling
- Fair computation with rational players
- On the classification of finite Boolean functions up to fairness
- Fairness versus guaranteed output delivery in secure multiparty computation
- Fair secure two-party computation protocol based on game theory
- An optimally fair coin toss
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Toward a game theoretic view of secure computation
- On complete primitives for fairness
- Efficient rational secret sharing in standard communication networks
- Partial fairness in secure two-party computation
- Complete Fairness in Multi-party Computation without an Honest Majority
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Partial fairness in secure two-party computation
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- scientific article; zbMATH DE number 1418289 (Why is no real title available?)
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete fairness in secure two-party computation
- Legally enforceable fairness in secure two-party communication
- An Efficient Protocol for Fair Secure Two-Party Computation
- Legally-Enforceable Fairness in Secure Two-Party Computation
- Progress in Cryptology - INDOCRYPT 2004
- Financial Cryptography and Data Security
- Towards characterizing complete fairness in secure two-party computation
- Fast optimistically fair cut-and-choose 2PC
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- On the power of an honest majority in three-party computation without broadcast
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Resource fairness and composability of cryptographic protocols
- Synchronizable fair exchange
- On secure computation of solitary output functionalities with and without broadcast
- Three party secure computation with friends and foes
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Can Alice and Bob guarantee output to Carol?
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Completeness in two-party secure computation: A computational view
This page was built for publication: Complete fairness in secure two-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549726)
