On the Classification of Finite Boolean Functions up to Fairness

DOI10.1007/978-3-319-10879-7_9zbMath1302.94055OpenAlexW129681726MaRDI QIDQ2922657

Nikolaos Makriyannis

Publication date: 14 October 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10879-7_9

zbMATH Keywords

secure two-party computationcomplete fairness

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ On fully secure MPC with solitary output ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ From fairness to full security in multiparty computation ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ MPC with friends and foes

This page was built for publication: On the Classification of Finite Boolean Functions up to Fairness