Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious

DOI10.1007/s00145-023-09466-2zbMath1518.94038OpenAlexW4379745981MaRDI QIDQ6109072

Eran Omri, Bar Alon

Publication date: 26 July 2023

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-023-09466-2

zbMATH Keywords

fair coin tossingdishonest majorityfair computationsecure multyparty computation (MPC)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial fairness in secure two-party computation
• Bit commitment using pseudorandomness
• The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
• Security and composition of multiparty cryptographic protocols
• On Fair Exchange, Fair Coins and Fair Sampling
• Secure Multi-Party Computation with Identifiable Abort
• On the Classification of Finite Boolean Functions up to Fairness
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
• On the Black-Box Complexity of Optimally-Fair Coin Tossing
• How to share a secret
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• Partial Fairness in Secure Two-Party Computation
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Protocols for Multiparty Coin Toss with Dishonest Majority
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• An Optimally Fair Coin Toss
• Foundations of Cryptography
• Coin flipping by telephone a protocol for solving impossible problems
• Fair Coin Flipping: Tighter Analysis and the Many-Party Case
• A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
• Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
• 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
• Coin flipping of any constant bias implies one-way functions
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Coin Flipping with Constant Bias Implies One-Way Functions
• Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
• Towards Characterizing Complete Fairness in Secure Two-Party Computation
• Theory of Cryptography
• On the complexity of fair coin flipping

This page was built for publication: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious