Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Compactness of hashing modes and efficiency beyond Merkle tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Indifferentiability of the Grøstl Hash Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Reductions of the Second Round SHA-3 Candidates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keccak / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Indifferentiability of the Sponge Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merkle Signatures with Virtually Unlimited Signature Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: CMSS – An Improved Merkle Signature Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Security Bounds for Key-Alternating Ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Span Programs and Succinct NIZKs without PCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Time-Stamp a Digital Document / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hash Functions Based on Three Permutations: A Generic Security Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Unified Method of Proving Indistinguishability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Coefficients H” Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Careful with Composition: Limitations of the Indifferentiability Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Build a Hash Function from Any Collision-Resistant Function / 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: Security/Efficiency Tradeoffs for Permutation-Based Hashing / 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 Collision Resistance Conjecture / 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: Q4409125 / rank
 
Normal rank

Latest revision as of 10:19, 27 July 2024

scientific article
Language Label Description Also known as
English
Compactness of hashing modes and efficiency beyond Merkle tree
scientific article

    Statements

    Compactness of hashing modes and efficiency beyond Merkle tree (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2021
    0 references
    optimally efficient cryptographically secure hash functions
    0 references
    compactness efficiency
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers