Black-box use of one-way functions is useless for optimal fair coin-tossing
type: Item
instance of: scholarly article
title: Black-box use of one-way functions is useless for optimal fair coin-tossing
zbMATH Open document ID: 1501.94048
DOI: 10.1007/978-3-030-56880-1_21
author: Hemanta K. Maji
author: Mingyuan Wang
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614581
zbMATH Keywords: two-party fair coin-tossing protocol
zbMATH Keywords: \(r\)-message coin-tossing protocol
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 21
OpenAlex ID: W3013833912
cites work: On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
cites work: On Fair Exchange, Fair Coins and Fair Sampling
cites work: Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
cites work: Towards Characterizing Complete Fairness in Secure Two-Party Computation
cites work: Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
cites work: A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
cites work: On the Impossibility of Tight Cryptographic Reductions
cites work: Notions of Black-Box Reductions, Revisited
cites work: On the Security of One-Witness Blind Signature Schemes
cites work: Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
cites work: 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
cites work: Protocols for Multiparty Coin Toss with Dishonest Majority
cites work: Why “Fiat-Shamir for Proofs” Lacks a Proof
cites work: Foundations of Non-malleable Hash and One-Way Functions
cites work: Breaking RSA may not be equivalent to factoring
cites work: PRF-ODH: relations, instantiations, and impossibility results
cites work: Breaking RSA may be as difficult as factoring
cites work: Fair Coin Flipping: Tighter Analysis and the Many-Party Case
cites work: The complexity of theorem-proving procedures
cites work: Q4409146
cites work: The Random Oracle Model and the Ideal Cipher Model Are Equivalent
cites work: On the Black-Box Complexity of Optimally-Fair Coin Tossing
cites work: Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
cites work: On the Instantiability of Hash-and-Sign RSA Signatures
cites work: On the Generic Insecurity of the Full Domain Hash
cites work: Nonmalleable Cryptography
cites work: Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
cites work: Q4472067
cites work: Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
cites work: Signatures from sequential-OR proofs
cites work: Random Oracles with(out) Programmability
cites work: On the Impossibility of Three-Move Blind Signature Schemes
cites work: Adaptive Security of Constrained PRFs
cites work: One-More assumptions do not help Fiat-Shamir-type signature schemes in NPROM
cites work: Limits on the power of garbling techniques for public-key encryption
cites work: On the round complexity of OT extension
cites work: Lower bounds on obfuscation from all-or-nothing encryption primitives
cites work: When does functional encryption imply obfuscation?
cites work: Lower bounds on the efficiency of encryption and digital signature schemes
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: Towards a Separation of Semantic and CCA Security for Public Key Encryption
cites work: Q3729902
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Q3549726
cites work: Partial Fairness in Secure Two-Party Computation
cites work: On the complexity of fair coin flipping
cites work: Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
cites work: Limits on the Usefulness of Random Oracles
cites work: Q3549591
cites work: An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
cites work: On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
cites work: A Pseudorandom Generator from any One-way Function
cites work: On tightly secure non-interactive key exchange
cites work: Possibility and impossibility results for selective decommitments
cites work: The equivalence of the random oracle model and the ideal cipher model, revisited
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Q5750403
cites work: Reducibility among Combinatorial Problems
cites work: Impossibility of Blind Signatures from One-Way Permutations
cites work: Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions
cites work: Limits of random oracles in secure computation
cites work: On the Power of Public-Key Encryption in Secure Computation
cites work: On the Power of Hierarchical Identity-Based Encryption
cites work: Lower Bounds on Assumptions Behind Indistinguishability Obfuscation

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: On the Classification of Finite Boolean Functions up to Fairness

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: On Black-Box Separations among Injective One-Way Functions

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: An Optimally Fair Coin Toss

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: On the security loss of unique signatures

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Bit commitment using pseudorandomness

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Advances in Cryptology - CRYPTO 2003

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Perfect zero-knowledge arguments for NP using any one-way permutation

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Limits of provable security from standard assumptions

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Theory of Cryptography

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Q4035723

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Measures, Integrals and Martingales

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Q4249649

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs

Black-box use of one-way functions is useless for optimal fair coin-tossing (cites work)
cites work: Black-Box Separations for One-More (Static) CDH and Its Generalization