On the public citation graph

An interactive identification scheme based on discrete logarithms and factoring

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_22openalex-snapshot
Efficient Identification and Signatures for Smart Cards
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-46885-4_35openalex-snapshot
Factoring by electronic mail
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-48184-2_3openalex-snapshot
Special Uses and Abuses of the Fiat-Shamir Passport Protocol (extended abstract)
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1007/bf02351718openalex-snapshot
A key distribution system equivalent to factoring
inferredcites →https://doi.org/10.1090/s0025-5718-1979-0528061-7openalex-snapshot
Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.1002/j.1538-7305.1991.tb00139.xopenalex-snapshot
Interactive Identification and Digital Signatures
inferred← citeshttps://doi.org/10.1007/10721064_1openalex-snapshot
User-Defined Divisibility of Ecash and a Practical Implementation
inferred← citeshttps://doi.org/10.1007/11426639_6openalex-snapshot
On Robust Combiners for Oblivious Transfer and Other Primitives
inferred← citeshttps://doi.org/10.1007/3-540-44750-4_24openalex-snapshot
Secure Signature Schemes based on Interactive Protocols
inferred← citeshttps://doi.org/10.1007/3-540-46513-8_12openalex-snapshot
Improving and Extending the Lim/Lee Exponentiation Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_17openalex-snapshot
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_3openalex-snapshot
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_30openalex-snapshot
Distance-Bounding Protocols
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_37openalex-snapshot
On Schnorr’s Preprocessing for Digital Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_26openalex-snapshot
Untraceable Off-line Cash in Wallet with Observers
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_3openalex-snapshot
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_11openalex-snapshot
More Flexible Exponentiation with Precomputation
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_19openalex-snapshot
Restrictive Binding of Secret-Key Certificates
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_6openalex-snapshot
Server(Prover/Signer)-Aided Verification of Identity Proofs and Signatures
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_65openalex-snapshot
Subliminal channels for signature transfer and their application to signature distribution schemes
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_70openalex-snapshot
Open problems in number theoretic complexity, II
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_86openalex-snapshot
Off-line electronic cash based on secret-key certificates
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_2openalex-snapshot
Generating EIGamal Signatures Without Knowing the Secret Key
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_22openalex-snapshot
Rapid Demonstration of Linear Relations Connected by Boolean Operators
inferred← citeshttps://doi.org/10.1007/978-0-387-35083-7_18openalex-snapshot
A Restrictive Blind Signature Scheme with Applications to Electronic Cash
inferred← citeshttps://doi.org/10.1007/978-0-387-73821-5_10openalex-snapshot
Efficient Trapdoor-Based Client Puzzle Against DoS Attacks
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_6openalex-snapshot
The Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-1-4899-1298-5_11openalex-snapshot
Security Management — An Overview to Reliable Authentication Procedures for Automatic Debiting Systems in RTI/IVHS Environments
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_24openalex-snapshot
Distribution of Modular Sums and the Security of the Server Aided Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_9openalex-snapshot
The Composite Discrete Logarithm and Secure Authentication
inferred← citeshttps://doi.org/10.1007/978-3-642-11925-5_20openalex-snapshot
Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
inferred← citeshttps://doi.org/10.1007/978-3-642-22786-8_52openalex-snapshot
Authentication in Wireless Sensor Networks Using Zero Knowledge Protocol
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/978-981-10-4600-1_17openalex-snapshot
An Extension to Modified Harn Digital Signature Scheme with the Feature of Message Recovery
inferred← citeshttps://doi.org/10.1007/bfb0028461openalex-snapshot
On the decomposition constructions for perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bfb0028490openalex-snapshot
Digital signature and public key cryptosystem in a prime order subgroup of Zn*
inferred← citeshttps://doi.org/10.1007/bfb0030871openalex-snapshot
On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
inferred← citeshttps://doi.org/10.1007/bfb0034844openalex-snapshot
A hidden cryptographic assumption in no-transferable indentification schemes
inferred← citeshttps://doi.org/10.1007/bfb0053421openalex-snapshot
A linear construction of perfect secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bfb0053426openalex-snapshot
Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —
inferred← citeshttps://doi.org/10.1007/bfb0053453openalex-snapshot
Efficient exponentiation using precomputation and vector addition chains
inferred← citeshttps://doi.org/10.1007/bfb0054143openalex-snapshot
Security analysis of a practical “on the fly” authentication and signature generation
inferred← citeshttps://doi.org/10.1007/bfb0054149openalex-snapshot
Secret sharing schemes with bipartite access structure
inferred← citeshttps://doi.org/10.1007/s00145-006-0224-0openalex-snapshot
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
inferred← citeshttps://doi.org/10.1007/s001459900016openalex-snapshot
On Schnorr’s preprocessing for digital signature schemes
inferred← citeshttps://doi.org/10.1007/s001459900056openalex-snapshot
On the Security of a Practical Identification Scheme
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00178-2openalex-snapshot
Several practical protocols for authentication and key exchange
inferred← citeshttps://doi.org/10.1016/j.comnet.2017.08.006openalex-snapshot
Energy-efficient mechanisms in security of the internet of things: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.025openalex-snapshot
Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00044-1openalex-snapshot
An algorithm for modular exponentiation
inferred← citeshttps://doi.org/10.1016/s0164-1212(98)00006-5openalex-snapshot
“Paramita wisdom” password authentication scheme without verification tables
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00277-0openalex-snapshot
Practical proofs of knowledge without relying on theoretical proofs of membership on languages
inferred← citeshttps://doi.org/10.1023/a:1008261021505openalex-snapshot
Unconditionally Secure Group Authentication
inferred← citeshttps://doi.org/10.1023/a:1021835718426openalex-snapshot
A New $$\mathcal{N}\mathcal{P} $$ -Complete Problem and Public-Key Identification
inferred← citeshttps://doi.org/10.1049/ip-cdt:19981773openalex-snapshot
Signature schemes based on factoring and discrete logarithms
inferred← citeshttps://doi.org/10.1049/ip-cdt:19990200openalex-snapshot
Security of Shao's signature schemes based on factoring and discrete logarithms
inferred← citeshttps://doi.org/10.1049/ip-com:20045278openalex-snapshot
Public key cryptosystem based on two cryptographic assumptions
inferred← citeshttps://doi.org/10.1109/12.392857openalex-snapshot
Improved digital signature suitable for batch verification
inferred← citeshttps://doi.org/10.1109/cises66934.2025.11265703openalex-snapshot
IIFP and IDLP based Public Key Isocryptosystem
inferred← citeshttps://doi.org/10.1109/icacci.2017.8126015openalex-snapshot
An efficient digital signature scheme by using integer factorization and discrete logarithm problem
inferred← citeshttps://doi.org/10.1109/icics.2003.1292757openalex-snapshot
Signature scheme based on composite discrete logarithm
inferred← citeshttps://doi.org/10.1109/ictta.2006.1684945openalex-snapshot
An Efficient Digital Multisignature Scheme
inferred← citeshttps://doi.org/10.1109/mcas.2003.1242832openalex-snapshot
Loading the bases: a new number representation with applications
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365702openalex-snapshot
Algorithmic number theory-the complexity contribution
inferred← citeshttps://doi.org/10.1145/319709.319715openalex-snapshot
On the fly signatures based on factoring
inferred← citeshttps://doi.org/10.14257/ijsia.2016.10.3.26openalex-snapshot
Novel Digital Signature Schemes based on Factoring and Discrete Logarithms
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.92openalex-snapshot
An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness
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.