Black-box use of one-way functions is useless for optimal fair coin-tossing
From MaRDI portal
Publication:2096541
DOI10.1007/978-3-030-56880-1_21zbMATH Open1501.94048OpenAlexW3013833912MaRDI QIDQ2096541FDOQ2096541
Authors: Hemanta K. Maji, Mingyuan Wang 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_21
Recommendations
Cites Work
- Reducibility among combinatorial problems
- Breaking RSA may be as difficult as factoring
- A Pseudorandom Generator from any One-way Function
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The complexity of theorem-proving procedures
- Bit commitment using pseudorandomness
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Statistically-hiding commitment from any one-way function
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Breaking RSA may not be equivalent to factoring
- Nonmalleable Cryptography
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Title not available (Why is that?)
- On the exact security of Schnorr-type signatures in the random oracle model
- Limits of random oracles in secure computation (extended abstract)
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Limits on the Usefulness of Random Oracles
- Advances in Cryptology - CRYPTO 2003
- Can optimally-fair coin tossing be based on one-way functions?
- Theory of Cryptography
- Complete fairness in secure two-party computation
- Protocols for multiparty coin toss with dishonest majority
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- On fair exchange, fair coins and fair sampling
- On the impossibility of three-move blind signature schemes
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Limits of provable security from standard assumptions
- On the Generic Insecurity of the Full Domain Hash
- Partial fairness in secure two-party computation
- An Optimally Fair Coin Toss
- Possibility and impossibility results for selective decommitments
- Advances in Cryptology – CRYPTO 2004
- Random oracles with(out) programmability
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Title not available (Why is that?)
- On the impossibility of tight cryptographic reductions
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- Limits on the power of garbling techniques for public-key encryption
- On the round complexity of OT extension
- One-More assumptions do not help Fiat-Shamir-type signature schemes in NPROM
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Fair coin flipping: tighter analysis and the many-party case
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- On the complexity of fair coin flipping
- PRF-ODH: relations, instantiations, and impossibility results
- Measures, integrals and martingales
- On the security loss of unique signatures
- Lower bounds on assumptions behind indistinguishability obfuscation
- Notions of black-box reductions, revisited
- On black-box separations among injective one-way functions
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- Why ``Fiat-Shamir for proofs lacks a proof
- Foundations of non-malleable hash and one-way functions
- On the power of hierarchical identity-based encryption
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- When does functional encryption imply obfuscation?
- On tightly secure non-interactive key exchange
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Towards characterizing complete fairness in secure two-party computation
- On the instantiability of hash-and-sign RSA signatures
- Signatures from sequential-OR proofs
- On the Security of One-Witness Blind Signature Schemes
- Adaptive Security of Constrained PRFs
- Limitations of the meta-reduction technique: the case of Schnorr signatures
- Black-box separations for one-more (static) CDH and its generalization
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- On the classification of finite Boolean functions up to fairness
- Impossibility of blind signatures from one-way permutations
- Lower bounds on the efficiency of encryption and digital signature schemes
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Computational two-party correlation: a dichotomy for key-agreement protocols
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- On the power of public-key encryption in secure computation
Cited In (9)
- Computational hardness of optimal fair computation: beyond Minicrypt
- Just how fair is an unreactive world?
- Coin flipping of any constant bias implies one-way functions
- Coin Flipping with Constant Bias Implies One-Way Functions
- On the complexity of fair coin flipping
- Can optimally-fair coin tossing be based on one-way functions?
- Polynomial-time targeted attacks on coin tossing for any number of corruptions
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- On the complexity of fair coin flipping
This page was built for publication: Black-box use of one-way functions is useless for optimal fair coin-tossing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096541)
