Black-box use of one-way functions is useless for optimal fair coin-tossing
From MaRDI portal
Publication:2096541
Recommendations
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1942447 (Why is no real title available?)
- scientific article; zbMATH DE number 2079922 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- Adaptive Security of Constrained PRFs
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- An Optimally Fair Coin Toss
- Bit commitment using pseudorandomness
- Black-box separations for one-more (static) CDH and its generalization
- Breaking RSA may be as difficult as factoring
- Breaking RSA may not be equivalent to factoring
- Can optimally-fair coin tossing be based on one-way functions?
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete fairness in secure two-party computation
- Computational two-party correlation: a dichotomy for key-agreement protocols
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- Fair coin flipping: tighter analysis and the many-party case
- Foundations of non-malleable hash and one-way functions
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Impossibility of blind signatures from one-way permutations
- Limitations of the meta-reduction technique: the case of Schnorr signatures
- Limits of provable security from standard assumptions
- Limits of random oracles in secure computation (extended abstract)
- Limits on the Usefulness of Random Oracles
- Limits on the power of garbling techniques for public-key encryption
- Lower bounds on assumptions behind indistinguishability obfuscation
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Lower bounds on the efficiency of encryption and digital signature schemes
- Measures, integrals and martingales
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Nonmalleable Cryptography
- Notions of black-box reductions, revisited
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- On black-box separations among injective one-way functions
- On fair exchange, fair coins and fair sampling
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- On the Generic Insecurity of the Full Domain Hash
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- On the Security of One-Witness Blind Signature Schemes
- On the classification of finite Boolean functions up to fairness
- On the complexity of fair coin flipping
- On the exact security of Schnorr-type signatures in the random oracle model
- On the impossibility of three-move blind signature schemes
- On the impossibility of tight cryptographic reductions
- On the instantiability of hash-and-sign RSA signatures
- On the power of hierarchical identity-based encryption
- On the power of public-key encryption in secure computation
- On the round complexity of OT extension
- On the security loss of unique signatures
- On tightly secure non-interactive key exchange
- One-More assumptions do not help Fiat-Shamir-type signature schemes in NPROM
- PRF-ODH: relations, instantiations, and impossibility results
- Partial fairness in secure two-party computation
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Possibility and impossibility results for selective decommitments
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Protocols for multiparty coin toss with dishonest majority
- Random oracles with(out) programmability
- Reducibility among combinatorial problems
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Signatures from sequential-OR proofs
- Statistically-hiding commitment from any one-way function
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- The complexity of theorem-proving procedures
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Theory of Cryptography
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Towards characterizing complete fairness in secure two-party computation
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- When does functional encryption imply obfuscation?
- Why ``Fiat-Shamir for proofs lacks a proof
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
Cited in
(9)- On the complexity of fair coin flipping
- 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
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)
