Towards characterizing complete fairness in secure two-party computation
From MaRDI portal
Publication:5746342
DOI10.1007/978-3-642-54242-8_13zbMATH Open1326.94070OpenAlexW2107507022MaRDI QIDQ5746342FDOQ5746342
Authors: Gilad Asharov 
Publication date: 18 February 2014
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_13
Recommendations
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete fairness in secure two-party computation
- Complete fairness in secure two-party computation
- On the classification of finite Boolean functions up to fairness
- Partial fairness in secure two-party computation
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)
Cited In (31)
- On complete primitives for fairness
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- On fully secure MPC with solitary output
- On the power of an honest majority in three-party computation without broadcast
- Computational hardness of optimal fair computation: beyond Minicrypt
- Partial fairness in secure two-party computation
- On secure computation of solitary output functionalities with and without broadcast
- Synchronizable fair exchange
- Three party secure computation with friends and foes
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- Secure two-party computation with fairness -- a necessary design principle
- Just how fair is an unreactive world?
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- Partial fairness in secure two-party computation
- Complete fairness in secure two-party computation
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Can Alice and Bob guarantee output to Carol?
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- Complete fairness in secure two-party computation
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Fairness versus guaranteed output delivery in secure multiparty computation
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Complete Fairness in Multi-party Computation without an Honest Majority
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- On the classification of finite Boolean functions up to fairness
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
This page was built for publication: Towards characterizing 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 Q5746342)
