Complete characterization of fairness in secure two-party computation of Boolean functions
From MaRDI portal
Publication:6621746
DOI10.1137/18M1232656MaRDI QIDQ6621746
Eran Omri, Nikolaos Makriyannis, Gilad Asharov, Amos Beimel
Publication date: 21 October 2024
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Boolean functions (94D10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Security and composition of multiparty cryptographic protocols
- Singularity of random Bernoulli matrices
- On Fair Exchange, Fair Coins and Fair Sampling
- On the Classification of Finite Boolean Functions up to Fairness
- Partial Fairness in Secure Two-Party Computation
- Protocols for Multiparty Coin Toss with Dishonest Majority
- Complete Fairness in Multi-party Computation without an Honest Majority
- Foundations of Cryptography
- On the Probability That a Random ± 1-Matrix Is Singular
- A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Secure Two-Party Computation
- Singular 0/1-Matrices, and the Hyperplanes Spanned by Random 0/1-Vectors
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- Theory of Cryptography
This page was built for publication: Complete characterization of fairness in secure two-party computation of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621746)
