On the public citation graph

A new authentication algorithm

0 signed · 18 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/3-540-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1978.1055873openalex-snapshot
On the inherent intractability of certain coding problems (Corresp.)
inferredcites →https://doi.org/10.1145/22145.22178openalex-snapshot
The knowledge complexity of interactive proof-systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44448-3_4openalex-snapshot
Cryptanalysis of the TTM Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_24openalex-snapshot
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
inferred← citeshttps://doi.org/10.1007/3-540-60693-9_28openalex-snapshot
Cryptanalysis of Harari's identification scheme
inferred← citeshttps://doi.org/10.1007/978-3-031-23201-5_1openalex-snapshot
Cryptanalysis of a Code-Based Identification Scheme Presented in CANS 2018
inferred← citeshttps://doi.org/10.1007/978-3-319-55589-8_15openalex-snapshot
A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-38616-9openalex-snapshot
Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-38616-9_14openalex-snapshot
The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-40663-8_5openalex-snapshot
Code Based Cryptography and Steganography
inferred← citeshttps://doi.org/10.1007/bfb0019841openalex-snapshot
Coding Theory and Applications
inferred← citeshttps://doi.org/10.1007/bfb0034862openalex-snapshot
The cryptographic security of the syndrome decoding problem for rank distance codes
inferred← citeshttps://doi.org/10.1007/s002000050053openalex-snapshot
Improved identification schemes based on error-correcting codes
inferred← citeshttps://doi.org/10.1109/asiajcis.2013.10openalex-snapshot
On Zero-Knowledge Identification Based on Q-ary Syndrome Decoding
inferred← citeshttps://doi.org/10.20381/ruor-4555openalex-snapshot
Light-Weight Authentication Schemes with Applications to RFID Systems
inferred← citeshttps://doi.org/10.48550/arxiv.0903.0069openalex-snapshot
Improved identity-based identification using correcting codes
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.