On the public citation graph

Collision-Resistant No More: Hash-and-Sign Paradigm Revisited

0 signed · 72 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.

Claim with ORCID

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.

See reference health

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/11426639_28openalex-snapshot

Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work

inferredcites →https://doi.org/10.1007/11426639_3openalex-snapshot

Collisions of SHA-0 and Reduced SHA-1

inferredcites →https://doi.org/10.1007/11535218openalex-snapshot

Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings

inferredcites →https://doi.org/10.1007/11535218_1openalex-snapshot

Efficient Collision Search Attacks on SHA-0

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/11535218_27openalex-snapshot

On the Generic Insecurity of the Full Domain Hash

inferredcites →https://doi.org/10.1007/11593447openalex-snapshot

Advances in Cryptology-- ASIACRYPT 2005 : 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005 : proceedings

inferredcites →https://doi.org/10.1007/11593447_1openalex-snapshot

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

inferredcites →https://doi.org/10.1007/11818175_3openalex-snapshot

Strengthening Digital Signatures Via Randomized Hashing

inferredcites →https://doi.org/10.1007/3-540-36288-6_9openalex-snapshot

The Cramer-Shoup Strong-RSA Signature Scheme Revisited

inferredcites →https://doi.org/10.1007/3-540-38424-3_22openalex-snapshot

The MD4 Message Digest Algorithm

inferredcites →https://doi.org/10.1007/3-540-44987-6_11openalex-snapshot

Hash Functions: From Merkle-Damgård to Shoup

inferredcites →https://doi.org/10.1007/3-540-45539-6_19openalex-snapshot

Using Hash Functions as a Hedge against Chosen Ciphertext Attack

inferredcites →https://doi.org/10.1007/3-540-45539-6_32openalex-snapshot

A Composition Theorem for Universal One-Way Hash Functions

inferredcites →https://doi.org/10.1007/3-540-46035-7_11openalex-snapshot

Performance Analysis and Parallel Implementation of Dedicated Hash Functions

inferredcites →https://doi.org/10.1007/3-540-46035-7_18openalex-snapshot

Optimal Security Proofs for PSS and Other Signature Schemes

inferredcites →https://doi.org/10.1007/3-540-46035-7_30openalex-snapshot

Traitor Tracing with Constant Transmission Rate

inferredcites →https://doi.org/10.1007/3-540-47721-7openalex-snapshot

Advances in Cryptology — CRYPTO’ 86

inferredcites →https://doi.org/10.1007/3-540-47721-7_12openalex-snapshot

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

inferredcites →https://doi.org/10.1007/3-540-48405-1openalex-snapshot

Advances in Cryptology — CRYPTO’ 99

inferredcites →https://doi.org/10.1007/3-540-48910-xopenalex-snapshot

Advances in Cryptology — EUROCRYPT ’99

inferredcites →https://doi.org/10.1007/3-540-48910-x_9openalex-snapshot

Secure Hash-and-Sign Signatures Without the Random Oracle

inferredcites →https://doi.org/10.1007/3-540-68339-9_34openalex-snapshot

The Exact Security of Digital Signatures-How to Sign with RSA and Rabin

inferredcites →https://doi.org/10.1007/3-540-68697-5openalex-snapshot

Advances in Cryptology — CRYPTO ’96

inferredcites →https://doi.org/10.1007/3-540-68697-5_1openalex-snapshot

Keying Hash Functions for Message Authentication

inferredcites →https://doi.org/10.1007/3-540-69053-0openalex-snapshot

Advances in Cryptology — EUROCRYPT ’97

inferredcites →https://doi.org/10.1007/3-540-69053-0_33openalex-snapshot

Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees

inferredcites →https://doi.org/10.1007/978-3-030-92078-4openalex-snapshot

Advances in Cryptology – ASIACRYPT 2021

inferredcites →https://doi.org/10.1007/978-3-031-07085-3openalex-snapshot

Advances in Cryptology – EUROCRYPT 2022

inferredcites →https://doi.org/10.1007/978-3-0348-8037-4_17openalex-snapshot

The Insecurity of the Digital Signature Algorithm with Partially Known Nonces

inferredcites →https://doi.org/10.1007/978-3-540-30539-2_14openalex-snapshot

Masking Based Domain Extenders for UOWHFs: Bounds and Constructions

inferredcites →https://doi.org/10.1007/978-3-540-30539-2_15openalex-snapshot

Higher Order Universal One-Way Hash Functions

inferredcites →https://doi.org/10.1007/978-3-540-46588-1_19openalex-snapshot

Design Validations for Discrete Logarithm Based Signature Schemes

inferredcites →https://doi.org/10.1007/978-3-662-49896-5openalex-snapshot

Advances in Cryptology – EUROCRYPT 2016

inferredcites →https://doi.org/10.1007/978-3-662-53018-4openalex-snapshot

Advances in Cryptology – CRYPTO 2016

inferredcites →https://doi.org/10.1007/978-3-662-54388-7openalex-snapshot

Public-Key Cryptography – PKC 2017

inferredcites →https://doi.org/10.1007/b136415openalex-snapshot

Advances in Cryptology-- EUROCRYPT 2005 : 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques : Aarhus, Denmark, May 22-26, 2005 : proceedings

inferredcites →https://doi.org/10.1007/bfb0052256openalex-snapshot

Collision-Resistant hashing: Towards making UOWHFs practical

inferredcites →https://doi.org/10.1007/bfb0054112openalex-snapshot

Advances in cryptology-EUROCRYPT '98 : International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31-June 4, 1998 : proceedings

inferredcites →https://doi.org/10.1007/bfb0054137openalex-snapshot

Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?

inferredcites →https://doi.org/10.1007/s00145-002-0021-3openalex-snapshot

The Insecurity of the Digital Signature Algorithm with Partially Known Nonces

inferredcites →https://doi.org/10.1007/s10623-003-6154-zopenalex-snapshot

Generic Groups, Collision Resistance, and ECDSA

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/sfcs.1982.72openalex-snapshot

How to generate cryptographically strong sequences of pseudo random bits

inferredcites →https://doi.org/10.1137/0213053openalex-snapshot

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

inferredcites →https://doi.org/10.1137/0217017openalex-snapshot

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

inferredcites →https://doi.org/10.1145/100216.100269openalex-snapshot

One-way functions are necessary and sufficient for secure signatures

inferredcites →https://doi.org/10.1145/168588.168596openalex-snapshot

Random oracles are practical

inferredcites →https://doi.org/10.1145/357830.357847openalex-snapshot

Signature schemes based on the strong RSA assumption

inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot

Universal one-way hash functions and their cryptographic applications

inferredcites →https://doi.org/10.1201/9781420035087-10openalex-snapshot

Public-Key Cryptography

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11818175_3openalex-snapshot

Strengthening Digital Signatures Via Randomized Hashing

inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_6openalex-snapshot

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions

inferred← citeshttps://doi.org/10.1007/978-3-540-73458-1_25openalex-snapshot

Hash-and-Sign with Weak Hashing Made Secure

inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_5openalex-snapshot

A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function

inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_8openalex-snapshot

Seven-Property-Preserving Iterated Hashing: ROX

inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_5openalex-snapshot

On Randomizing Hash Functions to Strengthen the Security of Digital Signatures

inferred← citeshttps://doi.org/10.1007/978-3-642-02620-1_11openalex-snapshot

Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders

inferred← citeshttps://doi.org/10.1007/978-3-642-13858-4_9openalex-snapshot

Domain Extension for Enhanced Target Collision-Resistant Hash Functions

inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_6openalex-snapshot

Strong Security from Probabilistic Signature Schemes

inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_19openalex-snapshot

Generalized First Pre-image Tractable Random Oracle Model and Signature Schemes

inferred← citeshttps://doi.org/10.1007/978-3-642-41227-1_5openalex-snapshot

Non Observability in the Random Oracle Model

inferred← citeshttps://doi.org/10.1007/978-3-662-49384-7_15openalex-snapshot

Mitigating Multi-target Attacks in Hash-Based Signatures

inferred← citeshttps://doi.org/10.1007/s00145-011-9109-yopenalex-snapshot

Security Analysis of Randomize-Hash-then-Sign Digital Signatures

inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.64openalex-snapshot

Classification of Hash Functions Suitable for Real-Life Systems

inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.5.1466openalex-snapshot

A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions

inferred← citeshttps://doi.org/10.1109/imitec45504.2019.9015847openalex-snapshot

A hybrid RSA-DH cipher for Signed Encrypted Messages

inferred← citeshttps://doi.org/10.1145/3597503.3639131openalex-snapshot

When Contracts Meets Crypto: Exploring Developers' Struggles with Ethereum Cryptographic APIs

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.