Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
From MaRDI portal
Publication:6109072
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
Cites work
- scientific article; zbMATH DE number 5485432 (Why is no real title available?)
- scientific article; zbMATH DE number 2013820 (Why is no real title available?)
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- An Optimally Fair Coin Toss
- Bit commitment using pseudorandomness
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Can optimally-fair coin tossing be based on one-way functions?
- Coin flipping by telephone a protocol for solving impossible problems
- Coin flipping of any constant bias implies one-way functions
- Coin flipping with constant bias implies one-way functions
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete fairness in secure two-party computation
- Efficient oblivious transfer protocols
- Fair coin flipping: tighter analysis and the many-party case
- Foundations of Cryptography
- How to share a secret
- On fair exchange, fair coins and fair sampling
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- On the classification of finite Boolean functions up to fairness
- On the complexity of fair coin flipping
- Partial fairness in secure two-party computation
- Partial fairness in secure two-party computation
- Protocols for multiparty coin toss with dishonest majority
- Secure multi-party computation with identifiable abort
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security and composition of multiparty cryptographic protocols
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
- Theory of Cryptography
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- Towards characterizing complete fairness in secure two-party computation
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
Cited in
(7)- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- 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
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)
