Compactness of hashing modes and efficiency beyond Merkle tree

DOI10.1007/978-3-030-77886-6_4zbMath1479.94114arXiv2104.15055OpenAlexW3174284130MaRDI QIDQ2056724

Arnab Roy, Elena Andreeva, Rishiraj Bhattacharyya

Publication date: 8 December 2021

Full work available at URL: https://arxiv.org/abs/2104.15055

zbMATH Keywords

compactness efficiencyoptimally efficient cryptographically secure hash functions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (max. 100)

Block-cipher-based tree hashing ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Collision-resistant and pseudorandom function based on Merkle-Damgård hash function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compactness of hashing modes and efficiency beyond Merkle tree
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
• Hash Functions Based on Three Permutations: A Generic Security Analysis
• Stam’s Conjecture and Threshold Phenomena in Collision Resistance
• Careful with Composition: Limitations of the Indifferentiability Framework
• Security Reductions of the Second Round SHA-3 Candidates
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Stam’s Collision Resistance Conjecture
• On the Indifferentiability of the Grøstl Hash Function
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Merkle Signatures with Virtually Unlimited Signature Capacity
• The “Coefficients H” Technique
• How to Time-Stamp a Digital Document
• Keccak
• Quadratic Span Programs and Succinct NIZKs without PCPs
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• How to Build a Hash Function from Any Collision-Resistant Function
• Tight Security Bounds for Key-Alternating Ciphers
• A Simple and Unified Method of Proving Indistinguishability
• CMSS – An Improved Merkle Signature Scheme
• On the Indifferentiability of the Sponge Construction
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Theory of Cryptography

This page was built for publication: Compactness of hashing modes and efficiency beyond Merkle tree