On the public citation graph

Security analysis of a practical “on the fly” authentication and signature generation

0 signed · 121 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-39568-7_5openalex-snapshot
Identity-Based Cryptosystems and Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-46416-6_42openalex-snapshot
Self-certified public keys
inferredcites →https://doi.org/10.1007/3-540-46416-6_43openalex-snapshot
Non-interactive Public-Key Cryptography
inferredcites →https://doi.org/10.1007/3-540-46877-3_44openalex-snapshot
An identity-based identification scheme based on discrete logarithms modulo a composite number
inferredcites →https://doi.org/10.1007/3-540-46877-3_6openalex-snapshot
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
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-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1007/3-540-48658-5_21openalex-snapshot
On the length of cryptographic hash-values used in identification schemes
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/3-540-68339-9_30openalex-snapshot
On the Security of a Practical Identification Scheme
inferredcites →https://doi.org/10.1007/3-540-68339-9_33openalex-snapshot
Security Proofs for Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-69053-0_18openalex-snapshot
Lower Bounds for Discrete Logarithms and Related Problems
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/bf00123958openalex-snapshot
Computation of discrete logarithms in prime fields
inferredcites →https://doi.org/10.1007/bf00191319openalex-snapshot
An interactive identification scheme based on discrete logarithms and factoring
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1007/bfb0034863openalex-snapshot
A World Wide Number Field Sieve factoring record: On to 512 bits
inferredcites →https://doi.org/10.1007/bfb0053426openalex-snapshot
Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —
inferredcites →https://doi.org/10.1016/s0022-0000(76)80043-8openalex-snapshot
Riemann's hypothesis and tests for primality
inferredcites →https://doi.org/10.1145/168588.168596openalex-snapshot
Random oracles are practical
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.1002/sec.1096openalex-snapshot
Improvement and optimized implementation of cryptoGPS protocol for low‐cost radio‐frequency identification authentication
inferred← citeshttps://doi.org/10.1007/10721064_14openalex-snapshot
Relaxing Tamper-Resistance Requirements for Smart Cards by Using (Auto-)Proxy Signatures
inferred← citeshttps://doi.org/10.1007/10958513_9openalex-snapshot
A Fast Signature Scheme Based on New On-line Computation
inferred← citeshttps://doi.org/10.1007/11496137_35openalex-snapshot
New Signature Schemes with Coupons and Tight Reduction
inferred← citeshttps://doi.org/10.1007/11535218_31openalex-snapshot
An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
inferred← citeshttps://doi.org/10.1007/11545262_4openalex-snapshot
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
inferred← citeshttps://doi.org/10.1007/11593447_33openalex-snapshot
Server-Aided Verification: Theory and Practice
inferred← citeshttps://doi.org/10.1007/11733447_17openalex-snapshot
Low-Cost Cryptography for Privacy in RFID Systems
inferred← citeshttps://doi.org/10.1007/11745853_3openalex-snapshot
Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/11767480_5openalex-snapshot
A Handy Multi-coupon System
inferred← citeshttps://doi.org/10.1007/11958239_3openalex-snapshot
Searching for Compact Algorithms: cgen
inferred← citeshttps://doi.org/10.1007/11967668_24openalex-snapshot
Public Key Cryptography and RFID Tags
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_18openalex-snapshot
Forward-Secure Signatures with Fast Key Update
inferred← citeshttps://doi.org/10.1007/3-540-36504-4_12openalex-snapshot
An Improved Fast Signature Scheme without Online Multiplication
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_29openalex-snapshot
On the Security of RDSA
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_18openalex-snapshot
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/3-540-44456-4_23openalex-snapshot
A Signcryption Scheme Based on Integer Factorization
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_29openalex-snapshot
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_26openalex-snapshot
Efficient “on the Fly” Signature Schemes Based on Integer Factoring
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_1openalex-snapshot
Faster Generation of NICE-Schnorr-Type Signatures
inferred← citeshttps://doi.org/10.1007/3-540-45439-x_25openalex-snapshot
An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party
inferred← citeshttps://doi.org/10.1007/3-540-45472-1_7openalex-snapshot
Sharing Decryption in the Context of Voting or Lotteries
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_13openalex-snapshot
Fair Encryption of RSA Keys
inferred← citeshttps://doi.org/10.1007/3-540-46088-8_17openalex-snapshot
Mutual Authentication for Low-Power Mobile Devices
inferred← citeshttps://doi.org/10.1007/3-540-46088-8_26openalex-snapshot
Optimistic Fair Exchange with Transparent Signature Recovery
inferred← citeshttps://doi.org/10.1007/3-540-46088-8_28openalex-snapshot
Non-interactive Private Auctions
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_14openalex-snapshot
A Group Signature Scheme with Improved Efficiency (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-69255-1_1openalex-snapshot
Elementary Attestation of Cryptographically Useful Composite Moduli
inferred← citeshttps://doi.org/10.1007/978-3-030-95312-6_2openalex-snapshot
A Pairing-Free Signature Scheme from Correlation Intractable Hash Function and Strong Diffie-Hellman Assumption
inferred← citeshttps://doi.org/10.1007/978-3-031-17146-8_31openalex-snapshot
A Toolbox for Verifiable Tally-Hiding E-Voting Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-38898-4_22openalex-snapshot
Slow Motion Zero Knowledge Identifying with Colliding Commitments
inferred← citeshttps://doi.org/10.1007/978-3-319-40367-0_5openalex-snapshot
Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry
inferred← citeshttps://doi.org/10.1007/978-3-319-59870-3_31openalex-snapshot
Solving the DLP with Low Hamming Weight Product Exponents and Improved Attacks on the GPS Identification Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-98989-1_17openalex-snapshot
Practical Strategy-Resistant Privacy-Preserving Elections
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_30openalex-snapshot
Public Key Authentication with One (Online) Single Addition
inferred← citeshttps://doi.org/10.1007/978-3-540-30144-8_5openalex-snapshot
Cryptanalysis of a Verifiably Committed Signature Scheme Based on GPS and RSA
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-540-45126-6_10openalex-snapshot
Cryptanalysis of the OTM Signature Scheme from FC’02
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_24openalex-snapshot
A New Type of Timing Attack: Application to GPS
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_11openalex-snapshot
Short Proofs of Knowledge for Factoring
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-540-47942-0_8openalex-snapshot
Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_11openalex-snapshot
ECC: Do We Need to Count?
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_7openalex-snapshot
Robust Threshold Schemes Based on the Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-78440-1_19openalex-snapshot
A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents
inferred← citeshttps://doi.org/10.1007/978-3-540-85053-3_23openalex-snapshot
RFID and Its Vulnerability to Faults
inferred← citeshttps://doi.org/10.1007/978-3-540-88353-1_2openalex-snapshot
The GPS Identification Scheme Using Frobenius Expansions
inferred← citeshttps://doi.org/10.1007/978-3-540-89641-8_7openalex-snapshot
An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-04642-1_5openalex-snapshot
Chosen-Ciphertext Secure RSA-Type Cryptosystems
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-14423-3_10openalex-snapshot
Lightweight Cryptography and RFID: Tackling the Hidden Overheads
inferred← citeshttps://doi.org/10.1007/978-3-642-20077-9_16openalex-snapshot
Privacy Enhancements for Hardware-Based Security Modules
inferred← citeshttps://doi.org/10.1007/978-3-642-22365-5_3openalex-snapshot
Vaudenay’s Privacy Model in the Universal Composability Framework: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_34openalex-snapshot
Tightly Secure Signatures From Lossy Identification Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_30openalex-snapshot
On Area, Time, and the Right Trade-Off
inferred← citeshttps://doi.org/10.1007/978-3-642-37288-9_4openalex-snapshot
Improved (and Practical) Public-Key Authentication for UHF RFID Tags
inferred← citeshttps://doi.org/10.1007/s00145-001-0005-8openalex-snapshot
Improving the exact security of digital signature schemes
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/s10660-014-9165-0openalex-snapshot
ECC-based untraceable authentication for large-scale active-tag RFID systems
inferred← citeshttps://doi.org/10.1007/s11432-008-0091-4openalex-snapshot
New designing of cryptosystems based on quadratic fields
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.05.023openalex-snapshot
Mutual authentication and group key agreement for low-power mobile devices
inferred← citeshttps://doi.org/10.1016/j.istr.2006.03.006openalex-snapshot
An overview of RFID tags and new cryptographic developments
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00049-xopenalex-snapshot
An intensive survey of fair non-repudiation protocols
inferred← citeshttps://doi.org/10.1016/s0169-4758(97)01169-1openalex-snapshot
Vaccination against Schistosomiasis: The case for Lung-stage Antigens
inferred← citeshttps://doi.org/10.1023/a:1014927327846openalex-snapshot
A Signature Scheme Based on the Intractability of Computing Roots
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/iet-cdt.2008.0165openalex-snapshot
Low-cost digital signature architecture suitable for radio frequency identification tags
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.5.1253openalex-snapshot
A Digital Signature Scheme Based on NP-Complete Lattice Problems
inferred← citeshttps://doi.org/10.1109/fdtc.2009.36openalex-snapshot
Fault Attack on Schnorr Based Identification and Signature Schemes
inferred← citeshttps://doi.org/10.1109/icics.2003.1292757openalex-snapshot
Signature scheme based on composite discrete logarithm
inferred← citeshttps://doi.org/10.1109/isbast.2008.4547638openalex-snapshot
User authentication scheme based on self-certified public-key for next generation wireless network
inferred← citeshttps://doi.org/10.1109/iscas.2007.378269openalex-snapshot
New Architectures for Low-Cost Public Key Cryptography on RFID Tags
inferred← citeshttps://doi.org/10.1109/scset55041.2022.00061openalex-snapshot
An efficient self-certified scheme based on discrete logarithms and factoring for MANETs
inferred← citeshttps://doi.org/10.1109/tdsc.2015.2445760openalex-snapshot
Optimized Identity-Based Encryption from Bilinear Pairing for Lightweight Devices
inferred← citeshttps://doi.org/10.1109/tit.2010.2044071openalex-snapshot
Parameterized Splitting Systems for the Discrete Logarithm
inferred← citeshttps://doi.org/10.1145/1868630.1868648openalex-snapshot
Elliptic curve cryptography based authentication protocol for small computational capacity RFID systems
inferred← citeshttps://doi.org/10.1145/2046707.2046781openalex-snapshot
Privacy and accountability for location-based aggregate statistics
inferred← citeshttps://doi.org/10.1145/319709.319715openalex-snapshot
On the fly signatures based on factoring
inferred← citeshttps://doi.org/10.1145/319709.319728openalex-snapshot
Efficient verifiable encryption (and fair exchange) of digital signatures
inferred← citeshttps://doi.org/10.1145/3457338.3458287openalex-snapshot
Perfect ZK Argument of Knowledge of Discrete Logarithm in A Cyclic Group with Unknown Order
inferred← citeshttps://doi.org/10.1145/570645.570648openalex-snapshot
Ariadne
inferred← citeshttps://doi.org/10.1145/984334.984335openalex-snapshot
Verifiable encryption of digital signatures and applications
inferred← citeshttps://doi.org/10.1360/zf2009-39-5-526openalex-snapshot
基于二次域的密码系统的新设计
inferred← citeshttps://doi.org/10.1515/jmc.2010.006openalex-snapshot
Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.1567openalex-snapshot
Lightweight One-Time Signature for Short Messages
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.92openalex-snapshot
An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness
inferred← citeshttps://doi.org/10.3217/09ecb-yjt84openalex-snapshot
Exploring the design space of the GPS authentication scheme
inferred← citeshttps://doi.org/10.3217/jucs-011-01-0175openalex-snapshot
RSA-based Certified Delivery of E-Goods Using Verifiable and Recoverable Signature Encryption
inferred← citeshttps://doi.org/10.3837/tiis.2010.04.002openalex-snapshot
Lightweight Cryptography and RFID: Tackling the Hidden Overhead
inferred← citeshttps://doi.org/10.4018/978-1-4666-5888-2.ch433openalex-snapshot
Security Aspects in Radio Frequency Identification Networks
inferred← citeshttps://doi.org/10.4018/978-1-61350-477-2.ch009openalex-snapshot
Security Aspects in Radio Frequency Identification Systems
inferred← citeshttps://doi.org/10.5121/ijnsa.2011.3106openalex-snapshot
Failure of A Mix Network
inferred← citeshttps://doi.org/10.5220/0002226501900197openalex-snapshot
CERTIFIED PSEUDONYMS COLLIGATED WITH MASTER SECRET KEY
inferred← citeshttps://doi.org/10.54097/2g9b0j24openalex-snapshot
Research and Development of Digital Signatures
inferred← citeshttps://doi.org/10.70675/1318aa16zaa04z47eez9a72z9266c7fcbcfbopenalex-snapshot
Outils cryptographiques pour la protection des contenus et de la vie privée des utilisateurs
inferred← citeshttps://doi.org/10.70675/5e74cea2z1935z4c7ez8e21zcfb975dbc797openalex-snapshot
Cryptography for pragmatic distributed trust and the role of blockchain
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/eddd8ffazdcb3z4837z8bf7z30902ba105e6openalex-snapshot
Integrity, authentication and confidentiality in public-key cryptography
inferred← citeshttps://doi.org/10.7146/brics.v5i27.19433openalex-snapshot
A Group Signature Scheme Based on an RSA-Variant
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.