On the public citation graph

Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm

https://doi.org/10.1007/11745853_3
0 signed · 35 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.1002/0471667196.ess1558openalex-snapshot
Mathematics of Computation
inferredcites →https://doi.org/10.1007/3-540-36178-2_8openalex-snapshot
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
inferredcites →https://doi.org/10.1007/3-540-39118-5_13openalex-snapshot
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
inferredcites →https://doi.org/10.1007/3-540-45961-8_7openalex-snapshot
Efficient Zero-Knowledge Identification Scheme for Smart Cards
inferredcites →https://doi.org/10.1007/3-540-46416-6_42openalex-snapshot
Self-certified public keys
inferredcites →https://doi.org/10.1007/3-540-46885-4_68openalex-snapshot
Efficient Identification and Signatures for Smart Cards
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_14openalex-snapshot
Demonstrating Possession of a Discrete Logarithm Without Revealing it
inferredcites →https://doi.org/10.1007/3-540-48910-x_8openalex-snapshot
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
inferredcites →https://doi.org/10.1007/3-540-68339-9_29openalex-snapshot
On Diffie-Hellman Key Agreement with Short Exponents
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_34openalex-snapshot
Traceable Signatures
inferredcites →https://doi.org/10.1007/978-3-540-30580-4_11openalex-snapshot
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
inferredcites →https://doi.org/10.1007/978-3-662-48800-3openalex-snapshot
Advances in Cryptology – ASIACRYPT 2015
inferredcites →https://doi.org/10.1007/b105124openalex-snapshot
Public Key Cryptography - PKC 2005
inferredcites →https://doi.org/10.1007/bfb0052225openalex-snapshot
Statistical zero knowledge protocols to prove modular polynomial relations
inferredcites →https://doi.org/10.1007/bfb0054143openalex-snapshot
Security analysis of a practical “on the fly” authentication and signature generation
inferredcites →https://doi.org/10.1007/bfb0055745openalex-snapshot
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0491431-9openalex-snapshot
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.1137/0218012openalex-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/11941378_11openalex-snapshot
On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-31371-4_18openalex-snapshot
Zero-Knowledge Arguments for Subverted RSA Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-24858-5_10openalex-snapshot
Two-Factor Authentication for the Bitcoin Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-79966-5_5openalex-snapshot
A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_25openalex-snapshot
On the Portability of Generalized Schnorr Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-15497-3_10openalex-snapshot
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Σ-Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-31680-7_2openalex-snapshot
Private Client-Side Profiling with Random Forests and Hidden Markov Models
inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_26openalex-snapshot
Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited
inferred← citeshttps://doi.org/10.1007/s10207-016-0325-1openalex-snapshot
Two-factor authentication for the Bitcoin protocol
inferred← citeshttps://doi.org/10.1007/s11424-009-9162-xopenalex-snapshot
Several cryptographic applications of Σ-protocol
inferred← citeshttps://doi.org/10.1515/jmc.2007.020openalex-snapshot
Another look at automated theorem-proving
inferred← citeshttps://doi.org/10.3934/amc.2019034openalex-snapshot
Critical perspectives on provable security: Fifteen years of "another look" papers
inferred← citeshttps://doi.org/10.82308/11345openalex-snapshot
Security aspects of zero knowledge identification schemes
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.