On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2991369715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On basing one-way functions on NP-hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4638056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the Power of Indistinguishability Obfuscation and Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Basing Size-Verifiable One-Way Functions on NP-Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Black-Box Reductions, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-collision resistant hash functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical difference beyond the polarizing regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure vs. hardness through the obfuscation lens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking the correctness of memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of Provable Security for Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case hardness for LPN and cryptographic hashing via code smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Worst‐Case to Average‐Case Reductions for NP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random oracles and non-uniformity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Instantiability of Hash-and-Sign RSA Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Black-Box Complexity of Optimally-Fair Coin Tossing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Reductions and Separations in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision-Free Hashing from Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Efficiency of Generic Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the power of garbling techniques for public-key encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Black-Box Reductions between Predicate Encryption Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Separation of Semantic and CCA Security for Public Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knowledge complexity of interactive proof-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)Possibility of Key Dependent Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: White-Box vs. Black-Box Complexity of Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision resistant hashing for paranoids: dealing with multiple collisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dual BKR Inequality and Rudich's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distributional collision resistant hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Basing Private Information Retrieval on NP-Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for collision-free hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete problem for statistical zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Oracles and Auxiliary Input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision resistant hashing from sub-exponential learning parity with noise / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:20, 22 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of collision resistant hash functions: new and old black-box separations
scientific article

    Statements

    On the complexity of collision resistant hash functions: new and old black-box separations (English)
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    lower bounds
    0 references
    indistinguishability obfuscation
    0 references
    functional encryption
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers