Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
From MaRDI portal
Publication:6109072
DOI10.1007/S00145-023-09466-2zbMATH Open1518.94038OpenAlexW4379745981MaRDI QIDQ6109072FDOQ6109072
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
Recommendations
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Protocols for multiparty coin toss with a dishonest majority
- Protocols for multiparty coin toss with dishonest majority
- Fair coin flipping: tighter analysis and the many-party case
- scientific article; zbMATH DE number 2009981
- Complete Fairness in Multi-party Computation without an Honest Majority
- A complete characterization of game-theoretically fair, multi-party coin toss
- Optimally efficient multi-party fair exchange and fair secure multi-party computation
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How to share a secret
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- Bit commitment using pseudorandomness
- Security and composition of multiparty cryptographic protocols
- Efficient oblivious transfer protocols
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Can optimally-fair coin tossing be based on one-way functions?
- Foundations of Cryptography
- Title not available (Why is that?)
- Complete fairness in secure two-party computation
- Protocols for multiparty coin toss with dishonest majority
- Partial fairness in secure two-party computation
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- Coin flipping of any constant bias implies one-way functions
- On fair exchange, fair coins and fair sampling
- Partial fairness in secure two-party computation
- An Optimally Fair Coin Toss
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Theory of Cryptography
- Coin flipping by telephone a protocol for solving impossible problems
- The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Fair coin flipping: tighter analysis and the many-party case
- On the complexity of fair coin flipping
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- Title not available (Why is that?)
- Towards characterizing complete fairness in secure two-party computation
- Secure multi-party computation with identifiable abort
- On the classification of finite Boolean functions up to fairness
- 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
- Coin flipping with constant bias implies one-way functions
Cited In (7)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Fair coin flipping: tighter analysis and the many-party case
- Game theoretic notions of fairness in multi-party coin toss
- Protocols for multiparty coin toss with a dishonest majority
- A complete characterization of game-theoretically fair, multi-party coin toss
- Protocols for multiparty coin toss with dishonest majority
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
This page was built for publication: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109072)
