scientific article; zbMATH DE number 1303133
From MaRDI portal
Publication:4249649
zbMath0919.94032MaRDI QIDQ4249649
Publication date: 9 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (67)
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Limits on the usefulness of random oracles ⋮ Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ The Journey from NP to TFNP Hardness ⋮ 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 ⋮ Construction of universal one-way hash functions: tree hashing revisited ⋮ On the gold standard for security of universal steganography ⋮ On the ring-LWE and polynomial-LWE problems ⋮ 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 ⋮ An analysis of the blockcipher-based hash functions from PGV ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Open problems in hash function security ⋮ Infeasibility of instance compression and succinct PCPs for NP ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function ⋮ 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 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 ⋮ 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 ⋮ Possibility and impossibility results for selective decommitments ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ Concealment and Its Applications to Authenticated Encryption ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Some observations on the theory of cryptographic hash functions ⋮ Bounds on the efficiency of black-box commitment schemes ⋮ 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 ⋮ 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? ⋮ Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512 ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ Homomorphic Evaluation Requires Depth ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ 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 impossibility of highly-efficient blockcipher-based hash functions ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ 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 ⋮ Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols ⋮ Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? ⋮ Generic groups, collision resistance, and ECDSA ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ 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 ⋮ On subset-resilient hash function families
This page was built for publication:
