Advances in Cryptology – CRYPTO 2004

DOI10.1007/b99099zbMath1104.94025OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311560

Chun-Yuan Hsiao, Leonid Reyzin

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99099

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (25)

Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Fully leakage-resilient signatures ⋮ 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 ⋮ On the (In)security of Kilian-based SNARGs ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Does Secure Time-Stamping Imply Collision-Free Hash Functions? ⋮ 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 non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Lifting standard model reductions to common setup assumptions ⋮ 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 ⋮ Possibility and impossibility results for selective decommitments ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Non-adaptive programmability of random oracle ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model ⋮ Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Unnamed Item ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions

This page was built for publication: Advances in Cryptology – CRYPTO 2004