On the public citation graph

Short 2-Move Undeniable Signatures

https://doi.org/10.1007/11958239_2
0 signed · 48 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_20openalex-snapshot
Undeniable Signatures
inferredcites →https://doi.org/10.1007/11426639_11openalex-snapshot
3-Move Undeniable Signature Scheme
inferredcites →https://doi.org/10.1007/11523468_38openalex-snapshot
Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction
inferredcites →https://doi.org/10.1007/11554868_11openalex-snapshot
Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers
inferredcites →https://doi.org/10.1007/11554868_14openalex-snapshot
Optimization of the MOVA Undeniable Signature Scheme
inferredcites →https://doi.org/10.1007/11596219openalex-snapshot
Progress in Cryptology - INDOCRYPT 2005
inferredcites →https://doi.org/10.1007/11596219_23openalex-snapshot
Short Undeniable Signatures Without Random Oracles: The Missing Link
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-36563-xopenalex-snapshot
Topics in Cryptology — CT-RSA 2003
inferredcites →https://doi.org/10.1007/3-540-36563-x_6openalex-snapshot
Invisibility and Anonymity of Undeniable and Confirmer Signatures
inferredcites →https://doi.org/10.1007/3-540-38424-3_14openalex-snapshot
Convertible Undeniable Signatures
inferredcites →https://doi.org/10.1007/3-540-39118-5openalex-snapshot
Advances in Cryptology — EUROCRYPT ’87
inferredcites →https://doi.org/10.1007/3-540-44586-2_8openalex-snapshot
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
inferredcites →https://doi.org/10.1007/3-540-44598-6openalex-snapshot
Advances in Cryptology — CRYPTO 2000
inferredcites →https://doi.org/10.1007/3-540-44598-6_14openalex-snapshot
On the Exact Security of Full Domain Hash
inferredcites →https://doi.org/10.1007/3-540-45539-6_17openalex-snapshot
Confirmer Signature Schemes Secure against Adaptive Adversaries
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-48405-1openalex-snapshot
Advances in Cryptology — CRYPTO’ 99
inferredcites →https://doi.org/10.1007/3-540-68339-9_13openalex-snapshot
Designated Verifier Proofs and Their Applications
inferredcites →https://doi.org/10.1007/978-3-030-92078-4openalex-snapshot
Advances in Cryptology – ASIACRYPT 2021
inferredcites →https://doi.org/10.1007/978-3-540-24632-9_6openalex-snapshot
Undeniable Signatures Based on Characters: How to Sign with One Bit
inferredcites →https://doi.org/10.1007/978-3-540-30539-2_25openalex-snapshot
Generic Homomorphic Undeniable Signatures
inferredcites →https://doi.org/10.1007/978-3-540-30580-4_23openalex-snapshot
The Security of the FDH Variant of Chaum’s Undeniable Signature Scheme
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_19openalex-snapshot
On Deniability in the Common Reference String and Random Oracle Model
inferredcites →https://doi.org/10.1007/978-3-662-49896-5openalex-snapshot
Advances in Cryptology – EUROCRYPT 2016
inferredcites →https://doi.org/10.1007/978-3-662-53018-4openalex-snapshot
Advances in Cryptology – CRYPTO 2016
inferredcites →https://doi.org/10.1007/b105124openalex-snapshot
Public Key Cryptography - PKC 2005
inferredcites →https://doi.org/10.1007/b11817openalex-snapshot
Advances in cryptology - CRYPTO 2003 : 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003 : proceedings
inferredcites →https://doi.org/10.1007/b136415openalex-snapshot
Advances in Cryptology-- EUROCRYPT 2005 : 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques : Aarhus, Denmark, May 22-26, 2005 : proceedings
inferredcites →https://doi.org/10.1007/b95631openalex-snapshot
Public key cryptography - PKC 2004 : 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1-4, 2004 : proceedings
inferredcites →https://doi.org/10.1007/bfb0052232openalex-snapshot
RSA-based undeniable signatures
inferredcites →https://doi.org/10.1007/s001450010001openalex-snapshot
RSA-Based Undeniable Signatures
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1109/sfcs.2003.1238212openalex-snapshot
Lower bounds for non-black-box zero knowledge
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1145/168588.168596openalex-snapshot
Random oracles are practical
inferredcites →https://doi.org/10.1201/9781420035087-10openalex-snapshot
Public-Key Cryptography

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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-642-00862-7_21openalex-snapshot
Practical Short Signature Batch Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-04138-9_29openalex-snapshot
On Tamper-Resistance from a Theoretical Viewpoint
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-19379-8_23openalex-snapshot
On-line Non-transferable Signatures Revisited
inferred← citeshttps://doi.org/10.1007/s00145-010-9070-1openalex-snapshot
Short Undeniable Signatures Based on Group Homomorphisms
inferred← citeshttps://doi.org/10.1109/isit.2008.4594982openalex-snapshot
Efficient convertible Limited Verifier Signatures
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.71openalex-snapshot
Efficient Convertible Undeniable Signatures with Delegatable Verification
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3691openalex-snapshot
Short undeniable signatures : design, analysis, and applications
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.