Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
From MaRDI portal
Recommendations
Cited in
(96)- On the impossibility of highly-efficient blockcipher-based hash functions
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
- On the gold standard for security of universal steganography
- On the ring-LWE and polynomial-LWE problems
- Necessary and sufficient conditions for collision-free hashing
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- On subset-resilient hash function families
- Computational hardness of optimal fair computation: beyond Minicrypt
- On building fine-grained one-way functions from strong average-case hardness
- On the complexity of collision resistant hash functions: new and old black-box separations
- Bounds on the efficiency of black-box commitment schemes
- The magic of ELFs
- Construction of universal one-way hash functions: tree hashing revisited
- On constructing one-way permutations from indistinguishability obfuscation
- Some observations on the theory of cryptographic hash functions
- Generic groups, collision resistance, and ECDSA
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- On derandomizing Yao's weak-to-strong OWF construction
- The cost of adaptivity in security games on graphs
- Homomorphic evaluation requires depth
- On constructing one-way permutations from indistinguishability obfuscation
- The Magic of ELFs
- Formalizing human ignorance
- Limits on the usefulness of random oracles
- Indistinguishable proofs of work or knowledge
- Concealment and its applications to authenticated encryption
- Collision-free hashing from lattice problems
- Limits on the power of indistinguishability obfuscation and functional encryption
- Pseudoentropy: lower-bounds for chain rules and transformations
- Towards non-black-box separations of public key encryption and one way function
- scientific article; zbMATH DE number 4207998 (Why is no real title available?)
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- Private coins versus public coins in zero-knowledge proof systems
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Hash Functions from Sigma Protocols and Improvements to VSH
- How to Fill Up Merkle-Damgård Hash Functions
- Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Salvaging Merkle-Damgård for Practical Applications
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- On the design of provably-secure cryptographic hash functions
- Possibility and impossibility results for selective decommitments
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- Low-complexity cryptographic hash functions
- The journey from NP to TFNP hardness
- A characterization of chameleon hash functions and new, efficient designs
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Structure versus hardness through the obfuscation lens
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Advances in Cryptology – CRYPTO 2004
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
- Theory of Cryptography
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Can PPAD hardness be based on standard cryptographic assumptions?
- An analysis of the blockcipher-based hash functions from PGV
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Collision-resistance from multi-collision-resistance
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
- On the impossibility of algebraic vector commitments in pairing-free groups
- Augmented random oracles
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Lifting standard model reductions to common setup assumptions
- On the impossibility of algebraic NIZK in pairing-free groups
- Publicly-verifiable deletion via target-collapsing functions
- On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes
- Infeasibility of instance compression and succinct PCPs for NP
- Collision Resistance from Multi-collision Resistance
- Constant-round arguments from one-way functions
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Searching for ELFs in the cryptographic forest
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Limits of black-box anamorphic encryption
- Collision resistance from multi-collision resistance for all constant parameters
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions
- On building fine-grained one-way functions from strong average-case hardness
- Instance compression, revisited
- Generic anamorphic encryption, revisited: new limitations and constructions
- Total NP search problems with abundant solutions
- One-way functions vs. TFNP: Simpler and improved
- On the black-box complexity of correlation intractability
- From one-time to two-round reusable multi-signatures without nested forking
- A one-way function based on norm form equations
- Black-box uselessness: composing separations in cryptography
- Separating pseudorandom codes from local oracles
- On the cryptographic futility of non-collapsing measurements
- Impossibility of post-quantum shielding black-box constructions of CCA from CPA
- Open problems in hash function security
This page was built for publication: Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249649)
