Complete characterization of fairness in secure two-party computation of Boolean functions

DOI10.1137/18M1232656MaRDI QIDQ6621746zbMATH OpenFDO

Authors Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri

Publication date 21 October 2024

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/18M1232656

zbMATH Keywords

fairnessfoundationssecure two-party computationmalicious adversaries

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Boolean functions (94D10)

Cites work

• scientific article; zbMATH DE number 4191105 (Why is no real title available?)
• scientific article; zbMATH DE number 2009950 (Why is no real title available?)
• scientific article; zbMATH DE number 1506177 (Why is no real title available?)
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• scientific article; zbMATH DE number 3245540 (Why is no real title available?)
• A full characterization of functions that imply fair coin tossing and ramifications to fairness
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Complete Fairness in Multi-party Computation without an Honest Majority
• Complete fairness in secure two-party computation
• 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
• Foundations of Cryptography
• On fair exchange, fair coins and fair sampling
• On the Probability That a Random ± 1-Matrix Is Singular
• 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
• Secure two-party computation with fairness -- a necessary design principle
• Security and composition of multiparty cryptographic protocols
• Singular 0/1-Matrices, and the Hyperplanes Spanned by Random 0/1-Vectors
• Singularity of random Bernoulli matrices
• Theory of Cryptography
• Towards characterizing complete fairness in secure two-party computation
• \(1/p\)-secure multiparty computation without honest majority and the best of both worlds

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)