The following pages link to (Q4249649):
Displayed 50 items.
- Limits on the usefulness of random oracles (Q290382) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- An analysis of the blockcipher-based hash functions from PGV (Q604636) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Open problems in hash function security (Q887443) (← links)
- On the impossibility of highly-efficient blockcipher-based hash functions (Q1027986) (← links)
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- On the gold standard for security of universal steganography (Q1648780) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- On subset-resilient hash function families (Q2115743) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← 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)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- The magic of ELFs (Q2318089) (← links)
- Construction of universal one-way hash functions: tree hashing revisited (Q2384401) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Some observations on the theory of cryptographic hash functions (Q2491271) (← links)
- Generic groups, collision resistance, and ECDSA (Q2572964) (← 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)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Homomorphic Evaluation Requires Depth (Q2796133) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- The Magic of ELFs (Q2835598) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Concealment and Its Applications to Authenticated Encryption (Q3000035) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← links)
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs (Q3408193) (← links)
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function (Q3503871) (← links)
- Does Secure Time-Stamping Imply Collision-Free Hash Functions? (Q3503876) (← links)
- Compression from Collisions, or Why CRHF Combiners Have a Long Output (Q3600232) (← links)
- Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
- How to Fill Up Merkle-Damgård Hash Functions (Q3600380) (← links)
- Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512 (Q3605393) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Salvaging Merkle-Damgård for Practical Applications (Q3627446) (← links)
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model (Q3627447) (← links)
- (Q4638056) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)