On the public citation graph
RSA-based undeniable signatures
0 signed · 137 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/3-540-38424-3_14openalex-snapshot
Convertible Undeniable Signatures
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-46416-6_19openalex-snapshot
Weaknesses of Undeniable Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-46416-6_20openalex-snapshot
Distributed Provers with Applications to Undeniable Signatures
inferredcites →https://doi.org/10.1007/3-540-46416-6_21openalex-snapshot
Interactive Bi-Proof Systems and Undeniable Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-46766-1_38openalex-snapshot
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
inferredcites →https://doi.org/10.1007/3-540-46877-3_41openalex-snapshot
Zero-Knowledge Undeniable Signatures (extended abstract)
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-48071-4_7openalex-snapshot
Wallet Databases with Observers
inferredcites →https://doi.org/10.1007/3-540-48658-5_8openalex-snapshot
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
inferredcites →https://doi.org/10.1007/3-540-68339-9_13openalex-snapshot
Designated Verifier Proofs and Their Applications
inferredcites →https://doi.org/10.1007/3-540-68339-9_32openalex-snapshot
New Convertible Undeniable Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-68339-9_34openalex-snapshot
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
inferredcites →https://doi.org/10.1007/3-540-68697-5_13openalex-snapshot
Robust and Efficient Sharing of RSA Functions
inferredcites →https://doi.org/10.1007/3-540-68697-5_15openalex-snapshot
Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers
inferredcites →https://doi.org/10.1007/bfb0053457openalex-snapshot
Blackmailing using undeniable signatures
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1109/sfcs.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1145/195058.195405openalex-snapshot
How to share a function securely
inferredcites →https://doi.org/10.1145/238168.238207openalex-snapshot
Breaking and repairing a convertible undeniable signature scheme
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1685openalex-snapshot
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
inferred← citeshttps://doi.org/10.1007/1-84628-352-3_14openalex-snapshot
Attack on Undeniable Partially Blind Signatures
inferred← citeshttps://doi.org/10.1007/10718964_32openalex-snapshot
An Anonymous Electronic Bidding Protocol Based on a New Convertible Group Signature Scheme
inferred← citeshttps://doi.org/10.1007/11426639_11openalex-snapshot
3-Move Undeniable Signature Scheme
inferred← citeshttps://doi.org/10.1007/11554868_14openalex-snapshot
Optimization of the MOVA Undeniable Signature Scheme
inferred← citeshttps://doi.org/10.1007/11556992_12openalex-snapshot
Chaum’s Designated Confirmer Signature Revisited
inferred← citeshttps://doi.org/10.1007/11596219_23openalex-snapshot
Short Undeniable Signatures Without Random Oracles: The Missing Link
inferred← citeshttps://doi.org/10.1007/11832072_3openalex-snapshot
Relations Among Security Notions for Undeniable Signature Schemes
inferred← citeshttps://doi.org/10.1007/11941378_15openalex-snapshot
Conditionally Verifiable Signature
inferred← citeshttps://doi.org/10.1007/11958239_2openalex-snapshot
Short 2-Move Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_6openalex-snapshot
Invisibility and Anonymity of Undeniable and Confirmer Signatures
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_7openalex-snapshot
A Secure Signature Scheme from Bilinear Maps
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_5openalex-snapshot
Attacking and Repairing Batch Verification Schemes
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_10openalex-snapshot
Marking: A Privacy Protecting Approach Against Blackmailing
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_8openalex-snapshot
Two-Party Generation of DSA Signatures
inferred← citeshttps://doi.org/10.1007/3-540-45247-8_11openalex-snapshot
An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA
inferred← citeshttps://doi.org/10.1007/3-540-45600-7_25openalex-snapshot
Threshold Undeniable RSA Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45600-7_52openalex-snapshot
Fair Exchange of Digital Signatures with Offline Trusted Third Party
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_31openalex-snapshot
Deniable Ring Authentication
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_14openalex-snapshot
RSA-Based Undeniable Signatures for General Moduli
inferred← citeshttps://doi.org/10.1007/3-540-47790-x_20openalex-snapshot
Undeniable Confirmer Signature
inferred← citeshttps://doi.org/10.1007/3-540-48109-5_21openalex-snapshot
Content-Fragile Watermarking Based on Content-Based Digital Signatures
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_27openalex-snapshot
Separability and Efficiency for Generic Group Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_8openalex-snapshot
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_22openalex-snapshot
Off-line Fair Payment Protocols using Convertible Signatures
inferred← citeshttps://doi.org/10.1007/3-540-68697-5_13openalex-snapshot
Robust and Efficient Sharing of RSA Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-99477-7_56openalex-snapshot
Agricultural Trusted Traceability Model Based on Blockchain
inferred← citeshttps://doi.org/10.1007/978-3-032-09586-2_5openalex-snapshot
Deliberately Flipping Bits in Memristive Crossbar Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_14openalex-snapshot
Hashing Solutions Instead of Generating Problems: On the Interactive Certification of RSA Moduli
inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_6openalex-snapshot
Undeniable Signatures Based on Characters: How to Sign with One Bit
inferred← citeshttps://doi.org/10.1007/978-3-540-24660-2_9openalex-snapshot
Identity Based Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-24852-1_10openalex-snapshot
Limited Verifier Signature from Bilinear Pairings
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_18openalex-snapshot
Near-Collisions of SHA-0
inferred← citeshttps://doi.org/10.1007/978-3-540-30079-3_30openalex-snapshot
On the Security of the Lee-Hwang Group-Oriented Undeniable Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-30144-8_8openalex-snapshot
Chameleon Hashing Without Key Exposure
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_20openalex-snapshot
Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
inferred← citeshttps://doi.org/10.1007/978-3-540-30574-3_12openalex-snapshot
Time-Selective Convertible Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-30580-4_15openalex-snapshot
The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity
inferred← citeshttps://doi.org/10.1007/978-3-540-30580-4_23openalex-snapshot
The Security of the FDH Variant of Chaum’s Undeniable Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-39927-8_27openalex-snapshot
A Novel Efficient Group Signature Scheme with Forward Security
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_11openalex-snapshot
Untraceable Fair Network Payment Protocols with Off-Line TTP
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_16openalex-snapshot
Accumulating Composites and Improved Group Signing
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_33openalex-snapshot
Universal Designated-Verifier Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-45080-1_10openalex-snapshot
Revocable Anonymity of Undeniable Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_12openalex-snapshot
Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_17openalex-snapshot
How to Prove That a Committed Number Is Prime
inferred← citeshttps://doi.org/10.1007/978-3-540-73489-5_21openalex-snapshot
Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
inferred← citeshttps://doi.org/10.1007/978-3-540-76969-9_2openalex-snapshot
A Generic Construction for Universally-Convertible Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-77535-5_2openalex-snapshot
Convertible Undeniable Proxy Signatures: Security Models and Efficient Construction
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_6openalex-snapshot
Threshold RSA for Dynamic and Ad-Hoc Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-79499-8_4openalex-snapshot
Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
inferred← citeshttps://doi.org/10.1007/978-3-642-12827-1_21openalex-snapshot
An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_13openalex-snapshot
Identity-Based Chameleon Hash Scheme without Key Exposure
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_5openalex-snapshot
A Framework for Constructing Convertible Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-21031-0_20openalex-snapshot
Short Convertible Undeniable Signature in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-642-22633-5_7openalex-snapshot
E-Voting: A New Approach Using Double-Blind Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-24861-0_24openalex-snapshot
An Efficient Construction of Time-Selective Convertible Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-31698-2_113openalex-snapshot
The Research of RSA-Based Undeniable Signature Method
inferred← citeshttps://doi.org/10.1007/978-3-642-31909-9_13openalex-snapshot
Optimistic Fair Exchange of Ring Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-45239-0_7openalex-snapshot
A Code-Based Undeniable Signature Scheme
inferred← citeshttps://doi.org/10.1007/bf02828656openalex-snapshot
Atomic electronic contract protocol based on convertible signature
inferred← citeshttps://doi.org/10.1007/bfb0054142openalex-snapshot
Generic constructions for secure and efficient confirmer signature schemes
inferred← citeshttps://doi.org/10.1007/s00145-007-0201-2openalex-snapshot
Robust and Efficient Sharing of RSA Functions
inferred← citeshttps://doi.org/10.1007/s00145-010-9070-1openalex-snapshot
Short Undeniable Signatures Based on Group Homomorphisms
inferred← citeshttps://doi.org/10.1007/s001459910011openalex-snapshot
Robust and Efficient Sharing of RSA Functions
inferred← citeshttps://doi.org/10.1007/s00200-016-0293-8openalex-snapshot
Undeniable signature scheme based over group ring
inferred← citeshttps://doi.org/10.1007/s10207-004-0041-0openalex-snapshot
Two-party generation of DSA signatures
inferred← citeshttps://doi.org/10.1007/s11042-007-0154-3openalex-snapshot
Methods for image authentication: a survey
inferred← citeshttps://doi.org/10.1007/s11128-019-2567-0openalex-snapshot
Quantum (t, n) threshold group signature based on Bell state
inferred← citeshttps://doi.org/10.1007/s11859-008-00622-2openalex-snapshot
Research on transferable off-line electronic cash system
inferred← citeshttps://doi.org/10.1007/s44443-026-00646-1openalex-snapshot
The bidirectional quantum digital signature with enhanced performance
inferred← citeshttps://doi.org/10.1016/j.amc.2003.12.084openalex-snapshot
Threshold undeniable signature scheme based on conic
inferred← citeshttps://doi.org/10.1016/j.ins.2007.08.009openalex-snapshot
Certificateless undeniable signature scheme
inferred← citeshttps://doi.org/10.1016/j.ins.2013.12.020openalex-snapshot
Identity-based chameleon hashing and signatures without key exposure
inferred← citeshttps://doi.org/10.1023/b:desi.0000012439.20075.16openalex-snapshot
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders
inferred← citeshttps://doi.org/10.1038/s41598-025-01114-yopenalex-snapshot
A traceable authentication system based on blockchain for decentralized physical infrastructure networks
inferred← citeshttps://doi.org/10.1109/aina.2006.198openalex-snapshot
Improvement of a Convertible Undeniable Partially Blind Signature Scheme
inferred← citeshttps://doi.org/10.1109/anthology.2013.6784885openalex-snapshot
A novel identity based undeniable signature scheme
inferred← citeshttps://doi.org/10.1109/cis.2011.214openalex-snapshot
Multi-Undeniable Signature Schemes
inferred← citeshttps://doi.org/10.1109/cis52066.2020.00082openalex-snapshot
SM9 Digital Signature with Non-repudiation
inferred← citeshttps://doi.org/10.1109/cns.2019.8802691openalex-snapshot
Secure Delegation to a Single Malicious Server: Exponentiation in RSA-type Groups
inferred← citeshttps://doi.org/10.1109/iaeac.2018.8577671openalex-snapshot
An Undeniable Signature Scheme based on Quasi-Dyadic Codes
inferred← citeshttps://doi.org/10.1109/ias.2007.27openalex-snapshot
Integrating Multi-Modal Circuit Features within an Efficient Encryption System
inferred← citeshttps://doi.org/10.1109/ias.2007.85openalex-snapshot
Certified Email Delivery with Offline TTP
inferred← citeshttps://doi.org/10.1109/ic3.2015.7346736openalex-snapshot
An efficient undeniable signature scheme using braid groups
inferred← citeshttps://doi.org/10.1109/icita.2005.293openalex-snapshot
Universal Designated-Verifier Signature with Aggregation
inferred← citeshttps://doi.org/10.1109/icppw.1999.800054openalex-snapshot
Modified Chinese remainder theorem and its application to proxy signatures
inferred← citeshttps://doi.org/10.1109/iwbis50925.2020.9255660openalex-snapshot
Aegis: A Framework to Detect Compromised Components in the Supply Chain of Information Technology Infrastructure
inferred← citeshttps://doi.org/10.1109/mmcs.1999.778274openalex-snapshot
Content-based digital signature for motion pictures authentication and content-fragile watermarking
inferred← citeshttps://doi.org/10.1109/snpd.2007.175openalex-snapshot
Semantic Approach to Visualization Service Discovery
inferred← citeshttps://doi.org/10.1109/snpd.2007.387openalex-snapshot
Application of Embedded System in Construction Machinery
inferred← citeshttps://doi.org/10.1109/tifs.2009.2035972openalex-snapshot
An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature
inferred← citeshttps://doi.org/10.1145/1060745.1060807openalex-snapshot
An abuse-free fair contract signing protocol based on the RSA signature
inferred← citeshttps://doi.org/10.1145/288090.288108openalex-snapshot
An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products
inferred← citeshttps://doi.org/10.1145/352600.352617openalex-snapshot
Simple forward-secure signatures from any signature scheme
inferred← citeshttps://doi.org/10.1145/872035.872060openalex-snapshot
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
inferred← citeshttps://doi.org/10.15388/informatica.2004.070openalex-snapshot
Proxy Confirmation Signatures
inferred← citeshttps://doi.org/10.15388/informatica.2011.322openalex-snapshot
A Method of Finding Bad Signatures in an RSA-Type Batch Verification
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.63openalex-snapshot
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.71openalex-snapshot
Efficient Convertible Undeniable Signatures with Delegatable Verification
inferred← citeshttps://doi.org/10.1587/transinf.e94.d.1210openalex-snapshot
Probabilistic Analysis on the Optimal Combination of Trial Division and Probabilistic Primality Tests for Safe Prime Generation
inferred← citeshttps://doi.org/10.3837/tiis.2013.06.010openalex-snapshot
Secure Convertible Undeniable Signature Scheme Using Extended Euclidean Algorithm without Random Oracles
inferred← citeshttps://doi.org/10.4304/jnw.6.9.1313-1320openalex-snapshot
A Fair Payment Protocol for Cascading P2P Transaction
inferred← citeshttps://doi.org/10.47715/jpc.b.978-93-91303-99-0openalex-snapshot
Cryptography and Security Fundamentals
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601049openalex-snapshot
Undeniable Signature Schemes Using Braid Groups
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3691openalex-snapshot
Short undeniable signatures : design, analysis, and applications
inferred← citeshttps://doi.org/10.5120/4952-7198openalex-snapshot
An Improved Security enabled Distribution of Protected Cloud Storage Services by Zero-Knowledge Proof based on RSA Assumption
inferred← citeshttps://doi.org/10.6633/ijns.200805.6(3).04openalex-snapshot
A Zero-knowledge Undeniable Signature Scheme in Non-abelian Group Setting
inferred← citeshttps://doi.org/10.7146/brics.v5i29.19435openalex-snapshot
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
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.