Parallel Hashing via List Recoverability (Q3457065): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1477430157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short PCPs with Polylog Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amplifying Collision Resistance: A Complexity-Theoretic Treatment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merkle-Damgård Revisited: How to Construct a Hash Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of statistically hiding bit commitment schemes and fail-stop signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain Extension for MACs Beyond the Birthday Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes / 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: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain Extension of Public Random Functions: Beyond the Birthday Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building a Collision-Resistant Compression Function from Non-compressing Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stam’s Conjecture and Threshold Phenomena in Collision Resistance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of Reed Solomon codes beyond the error-correction bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Break MD5 and Other Hash Functions / rank
 
Normal rank

Latest revision as of 05:18, 11 July 2024

scientific article
Language Label Description Also known as
English
Parallel Hashing via List Recoverability
scientific article

    Statements

    Parallel Hashing via List Recoverability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 December 2015
    0 references
    0 references
    0 references