Pages that link to "Item:Q5311560"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2004 (Q5311560):
Displaying 29 items.
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Non-adaptive programmability of random oracle (Q500974) (← links)
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q2692335) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Does Secure Time-Stamping Imply Collision-Free Hash Functions? (Q3503876) (← links)
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model (Q3627447) (← links)
- (Q4638056) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? (Q5505474) (← links)
- CCA security and trapdoor functions via key-dependent-message security (Q5918652) (← links)
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model (Q6157502) (← links)
- Lifting standard model reductions to common setup assumptions (Q6169031) (← links)
- Collision Resistance from Multi-collision Resistance (Q6489330) (← links)
- Searching for ELFs in the cryptographic forest (Q6582218) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q6617635) (← links)
- On sequential functions and fine-grained cryptography (Q6652975) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)
