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_21zbMath1501.94048OpenAlexW3013833912MaRDI QIDQ2096541
Mingyuan Wang, Hemanta K. Maji
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_21
Related Items (3)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ On the complexity of fair coin flipping
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Breaking RSA may be as difficult as factoring
- Possibility and impossibility results for selective decommitments
- 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
- Bit commitment using pseudorandomness
- Perfect zero-knowledge arguments for NP using any one-way permutation
- On the security loss of unique signatures
- PRF-ODH: relations, instantiations, and impossibility results
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- When does functional encryption imply obfuscation?
- On tightly secure non-interactive key exchange
- Signatures from sequential-OR proofs
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
- On Fair Exchange, Fair Coins and Fair Sampling
- On the Security of One-Witness Blind Signature Schemes
- Notions of Black-Box Reductions, Revisited
- On the Instantiability of Hash-and-Sign RSA Signatures
- Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
- On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- On the Classification of Finite Boolean Functions up to Fairness
- Adaptive Security of Constrained PRFs
- Black-Box Separations for One-More (Static) CDH and Its Generalization
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- Measures, Integrals and Martingales
- Limits of random oracles in secure computation
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- On Black-Box Separations among Injective One-Way Functions
- Impossibility of Blind Signatures from One-Way Permutations
- Random Oracles with(out) Programmability
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
- Partial Fairness in Secure Two-Party Computation
- On the Impossibility of Three-Move Blind Signature Schemes
- Lower bounds on the efficiency of encryption and digital signature schemes
- Protocols for Multiparty Coin Toss with Dishonest Majority
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- An Optimally Fair Coin Toss
- Foundations of Non-malleable Hash and One-Way Functions
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Breaking RSA may not be equivalent to 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
- Nonmalleable Cryptography
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- Why “Fiat-Shamir for Proofs” Lacks a Proof
- A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
- Limits on the Usefulness of Random Oracles
- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
- Reducibility among Combinatorial Problems
- 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
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Advances in Cryptology – CRYPTO 2004
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Limits of provable security from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- On the Generic Insecurity of the Full Domain Hash
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- The complexity of theorem-proving procedures
- On the Power of Hierarchical Identity-Based Encryption
- On the Impossibility of Tight Cryptographic Reductions
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
- On the Power of Public-Key Encryption in Secure Computation
- 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: Black-box use of one-way functions is useless for optimal fair coin-tossing
