On the public citation graph
A (non-practical) three-pass identification protocol using coding theory
0 signed · 30 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_54openalex-snapshot
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-46885-4_19openalex-snapshot
An alternative to the Fiat-Shamir protocol
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/bfb0019850openalex-snapshot
A method for finding codewords of small weight
inferredcites →https://doi.org/10.1109/tit.1978.1055873openalex-snapshot
On the inherent intractability of certain coding problems (Corresp.)
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-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_24openalex-snapshot
A new algorithm for finding minimum-weight words in large linear codes
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-030-16458-4_18openalex-snapshot
Quasi-Dyadic Girault Identification Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-51938-4_3openalex-snapshot
LESS is More: Code-Based Signatures Without Syndromes
inferred← citeshttps://doi.org/10.1007/978-3-030-81652-0_15openalex-snapshot
Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over $$\mathbb {F}_q$$
inferred← citeshttps://doi.org/10.1007/978-3-031-68382-4_2openalex-snapshot
Lossy Cryptography from Code-Based Assumptions
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-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/bfb0034862openalex-snapshot
The cryptographic security of the syndrome decoding problem for rank distance codes
inferred← citeshttps://doi.org/10.1007/s00145-025-09553-6openalex-snapshot
Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK
inferred← citeshttps://doi.org/10.1007/s002000050053openalex-snapshot
Improved identification schemes based on error-correcting codes
inferred← citeshttps://doi.org/10.1007/s10623-023-01338-xopenalex-snapshot
Hardness estimates of the code equivalence problem in the rank metric
inferred← citeshttps://doi.org/10.1049/el:19941106openalex-snapshot
Improved Girault identification scheme
inferred← citeshttps://doi.org/10.1109/ares.2013.54openalex-snapshot
A Generation Method of Cryptographic Keys for Enterprise Communication Systems
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.1109/isit54713.2023.10206940openalex-snapshot
A Search-to-Decision Reduction for the Permutation Code Equivalence Problem
inferred← citeshttps://doi.org/10.1109/tit.2023.3323068openalex-snapshot
Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems
inferred← citeshttps://doi.org/10.18255/1818-1015-2018-3-276-290openalex-snapshot
The Support Splitting Algorithm for Induced Codes
inferred← citeshttps://doi.org/10.3103/s0146411619070125openalex-snapshot
On the Support Splitting Algorithm for Induced Codes
inferred← citeshttps://doi.org/10.48550/arxiv.0903.0069openalex-snapshot
Improved identity-based identification using correcting codes
inferred← citeshttps://doi.org/10.5753/sbseg.2011.20566openalex-snapshot
Zero-knowledge Identification based on Lattices with Low Communication Costs
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.