On the public citation graph
Verified Security of Merkle-Damgård
0 signed · 55 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-34805-0_39openalex-snapshot
A Design Principle for Hash Functions
inferredcites →https://doi.org/10.1007/0-387-34805-0_40openalex-snapshot
One Way Hash Functions and DES
inferredcites →https://doi.org/10.1007/11426639_2openalex-snapshot
How to Break MD5 and Other Hash Functions
inferredcites →https://doi.org/10.1007/11535218_2openalex-snapshot
Finding Collisions in the Full SHA-1
inferredcites →https://doi.org/10.1007/11535218_26openalex-snapshot
Merkle-Damgård Revisited: How to Construct a Hash Function
inferredcites →https://doi.org/10.1007/11541868_21openalex-snapshot
Formal Verification of a SHA-1 Circuit Core Using ACL2
inferredcites →https://doi.org/10.1007/11593447_26openalex-snapshot
A Failure-Friendly Design Principle for Hash Functions
inferredcites →https://doi.org/10.1007/11814948_13openalex-snapshot
Applications of SAT Solvers to Cryptanalysis of Hash Functions
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_2openalex-snapshot
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
inferredcites →https://doi.org/10.1007/978-3-540-25937-4_24openalex-snapshot
Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance
inferredcites →https://doi.org/10.1007/978-3-540-76900-2_8openalex-snapshot
Seven-Property-Preserving Iterated Hashing: ROX
inferredcites →https://doi.org/10.1007/978-3-540-78967-3_11openalex-snapshot
On the Indifferentiability of the Sponge Construction
inferredcites →https://doi.org/10.1007/978-3-642-13858-4_10openalex-snapshot
Security Analysis of the Mode of JH Hash Function
inferredcites →https://doi.org/10.1007/978-3-642-14052-5_10openalex-snapshot
Programming Language Techniques for Cryptographic Proofs
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_13openalex-snapshot
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
inferredcites →https://doi.org/10.1007/978-3-642-15317-4_7openalex-snapshot
On the Indifferentiability of the Grøstl Hash Function
inferredcites →https://doi.org/10.1007/978-3-642-17373-8_1openalex-snapshot
Rotational Rebound Attacks on Reduced Skein
inferredcites →https://doi.org/10.1007/978-3-642-18178-8_5openalex-snapshot
Security Reductions of the Second Round SHA-3 Candidates
inferredcites →https://doi.org/10.1007/978-3-642-19074-2_13openalex-snapshot
Beyond Provable Security Verifiable IND-CCA Security of OAEP
inferredcites →https://doi.org/10.1007/978-3-642-20465-4_27openalex-snapshot
Careful with Composition: Limitations of the Indifferentiability Framework
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_5openalex-snapshot
Computer-Aided Security Proofs for the Working Cryptographer
inferredcites →https://doi.org/10.1007/978-3-642-25379-9_27openalex-snapshot
Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience
inferredcites →https://doi.org/10.1007/978-3-642-28641-4_12openalex-snapshot
Verified Indifferentiable Hashing into Elliptic Curves
inferredcites →https://doi.org/10.1007/978-3-642-31410-0_18openalex-snapshot
Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
inferredcites →https://doi.org/10.1007/978-3-642-35999-6_21openalex-snapshot
Provable Security of BLAKE with Non-ideal Compression Function
inferredcites →https://doi.org/10.1007/s00145-008-9030-1openalex-snapshot
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
inferredcites →https://doi.org/10.1007/s10623-010-9458-9openalex-snapshot
Classification and generation of disturbance vectors for collision attacks against SHA-1
inferredcites →https://doi.org/10.1109/csf.2012.13openalex-snapshot
Generic Indifferentiability Proofs of Hash Designs
inferredcites →https://doi.org/10.1145/1008731.1008734openalex-snapshot
The random oracle methodology, revisited
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/1594834.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-23237-9_22openalex-snapshot
Fragmented-Iterated Bloom Filters for Routing in Distributed Event-Based Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_2openalex-snapshot
Computer-Aided Cryptographic Proofs
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_20openalex-snapshot
Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
inferred← citeshttps://doi.org/10.1007/978-981-96-0888-1_5openalex-snapshot
Digital Signatures with Outsourced Hashing
inferred← citeshttps://doi.org/10.1007/s10623-015-0096-0openalex-snapshot
Open problems in hash function security
inferred← citeshttps://doi.org/10.1016/j.bcra.2025.100368openalex-snapshot
FSA: A framework for analyzing secondary preimage attacks on Merkle proof-based airdrops
inferred← citeshttps://doi.org/10.1016/j.future.2017.02.021openalex-snapshot
A Distributed Event-Based System based on Compressed Fragmented-Iterated Bloom Filters
inferred← citeshttps://doi.org/10.1016/j.iot.2024.101193openalex-snapshot
Merkle trees in blockchain: A Study of collision probability and security implications
inferred← citeshttps://doi.org/10.1109/access.2024.3368453openalex-snapshot
How to Formalize Loop Iterations in Cryptographic Protocols Using ProVerif
inferred← citeshttps://doi.org/10.1109/access.2024.3384705openalex-snapshot
Enhanced Security and Efficiency in Blockchain with Aggregated Zero-Knowledge Proof Mechanisms
inferred← citeshttps://doi.org/10.1109/csf.2017.36openalex-snapshot
Mechanizing the Proof of Adaptive, Information-Theoretic Security of Cryptographic Protocols in the Random Oracle Model
inferred← citeshttps://doi.org/10.1145/2701415openalex-snapshot
Verification of a Cryptographic Primitive
inferred← citeshttps://doi.org/10.1145/3278312.3278318openalex-snapshot
Improved MD5 through the extension of 1024 Message Input Block
inferred← citeshttps://doi.org/10.1145/3288155.3288173openalex-snapshot
Enhancing MD5 Collision Susceptibility
inferred← citeshttps://doi.org/10.1145/3319535.3363211openalex-snapshot
Machine-Checked Proofs for Cryptographic Standards
inferred← citeshttps://doi.org/10.17706/jsw.12.4.240-252openalex-snapshot
Enhancement of MD5 Algorithm for Secured Web Development
inferred← citeshttps://doi.org/10.20868/upm.thesis.23088openalex-snapshot
Approximate Relational Reasoning for Probabilistic Programs
inferred← citeshttps://doi.org/10.3233/jcs-130476openalex-snapshot
Verified indifferentiable hashing into elliptic curves
inferred← citeshttps://doi.org/10.3390/healthcare10071275openalex-snapshot
Design of Smart and Secured Healthcare Service Using Deep Learning with Modified SHA-256 Algorithm
inferred← citeshttps://doi.org/10.56294/sctconf2023526openalex-snapshot
Unlocking Security: Pioneering a Novel Elliptic Curve-Based Hashing Scheme
inferred← citeshttps://doi.org/10.70675/40952066zf46ez4342zae06zd2607d63fec6openalex-snapshot
Formal Security Proofs of Cryptographic : A necessity achieved using EasyCrypt
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.