On the public citation graph

On concrete security treatment of signatures derived from identification

https://doi.org/10.1007/bfb0055741
0 signed · 106 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-57332-1_11openalex-snapshot
A digital multisignature scheme based on the Fiat-Shamir 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-68339-9_34openalex-snapshot
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/100216.100269openalex-snapshot
One-way functions are necessary and sufficient for secure signatures
inferredcites →https://doi.org/10.1145/168588.168596openalex-snapshot
Random oracles are practical
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications

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.334openalex-snapshot
Convertible ring signatures with gradual revelation of non‐signers
inferred← citeshttps://doi.org/10.1007/0-387-23483-7_369openalex-snapshot
Schnorr Digital Signature Scheme
inferred← citeshttps://doi.org/10.1007/11424826_65openalex-snapshot
Linkable Ring Signatures: Security Models and New Schemes
inferred← citeshttps://doi.org/10.1007/11496618_16openalex-snapshot
On the Security Models of (Threshold) Ring Signature Schemes
inferred← citeshttps://doi.org/10.1007/11601494_1openalex-snapshot
Efficient Verifiable Ring Encryption for Ad Hoc Groups
inferred← citeshttps://doi.org/10.1007/11751595_38openalex-snapshot
Efficient Partially Blind Signatures with Provable Security
inferred← citeshttps://doi.org/10.1007/11809678_40openalex-snapshot
Efficient Partially Blind Signature Scheme with Provable Security
inferred← citeshttps://doi.org/10.1007/11818175_32openalex-snapshot
Automated Security Proofs with Sequences of Games
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_26openalex-snapshot
1-out-of-n Signatures from a Variety of Keys
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_10openalex-snapshot
Strong Key-Insulated Signature Schemes
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_25openalex-snapshot
A Signature Scheme as Secure as the Diffie-Hellman Problem
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_17openalex-snapshot
Provably Secure Partially Blind Signatures
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_6openalex-snapshot
Formal Proofs for the Security of Signcryption
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_1openalex-snapshot
Practical Security in Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_18openalex-snapshot
Optimal Security Proofs for PSS and Other Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_28openalex-snapshot
From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security
inferred← citeshttps://doi.org/10.1007/3-540-46701-7_15openalex-snapshot
Improving the Exact Security of Fiat-Shamir Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_28openalex-snapshot
A Forward-Secure Digital Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_1openalex-snapshot
Practice-Oriented Provable-Security
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_6openalex-snapshot
Encrypted Message Authentication by Firewalls
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_4openalex-snapshot
Provable Security for Public Key Schemes
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_154openalex-snapshot
Schnorr Digital Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-03638-6_10openalex-snapshot
The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_23openalex-snapshot
Security of Hedged Fiat–Shamir Signatures Under Fault Attacks
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_20openalex-snapshot
New Techniques in Replica Encodings with Client Setup
inferred← citeshttps://doi.org/10.1007/978-3-030-65277-7_24openalex-snapshot
The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_154openalex-snapshot
Schnorr Digital Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-88323-2_1openalex-snapshot
Concurrent Signatures from a Variety of Keys
inferred← citeshttps://doi.org/10.1007/978-3-030-92068-5_8openalex-snapshot
Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-031-31368-4_9openalex-snapshot
Hardening Signature Schemes via Derive-then-Derandomize: Stronger Security Proofs for EdDSA
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_3openalex-snapshot
Exclusive Ownership of Fiat-Shamir Signatures: ML-DSA, SQIsign, LESS, and More
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_9openalex-snapshot
T-Spoon: Tightly Secure Two-Round Multi-signatures with Key Aggregation
inferred← citeshttps://doi.org/10.1007/978-3-032-25291-3_6openalex-snapshot
Earpicks: Tightly Secure Two-Round Multi and Threshold Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_8openalex-snapshot
From Obfuscation to the Security of Fiat-Shamir for Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_17openalex-snapshot
Security Proofs for Identity-Based Identification and Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_2openalex-snapshot
A Separable Threshold Ring Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-27800-9_28openalex-snapshot
Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-30598-9_3openalex-snapshot
On the Security Notions for Public-Key Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_10openalex-snapshot
Chosen-Ciphertext Security for Any One-Way Cryptosystem
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-46588-1_19openalex-snapshot
Design Validations for Discrete Logarithm Based Signature Schemes
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_13openalex-snapshot
Delegation Chains Secure Up to Constant Length
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_14openalex-snapshot
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-540-72905-1_9openalex-snapshot
Efficient Linkable Ring Signatures and Threshold Signatures from Linear Feedback Shift Register
inferred← citeshttps://doi.org/10.1007/978-3-540-74484-9_96openalex-snapshot
Efficient Partially Blind Signatures with Provable Security
inferred← citeshttps://doi.org/10.1007/978-3-540-77090-9_65openalex-snapshot
A Practical Identity-Based Signature Scheme from Bilinear Map
inferred← citeshttps://doi.org/10.1007/978-3-540-78440-1_8openalex-snapshot
Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_23openalex-snapshot
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-04642-1_11openalex-snapshot
On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-15317-4_23openalex-snapshot
The Fiat–Shamir Transform for Group and Ring Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_1openalex-snapshot
Improved Zero-Knowledge Identification with Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-16576-4_19openalex-snapshot
Design and Analysis of “Flexible” k-out-of-n Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_2openalex-snapshot
Extended Security Arguments for Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_4openalex-snapshot
Why Proving HIBE Systems Secure Is Difficult
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_2openalex-snapshot
Optimal Security Proofs for Signatures from Identification Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_15openalex-snapshot
From Identification to Signatures, Tightly: A Framework and Generic Transforms
inferred← citeshttps://doi.org/10.1007/978-3-662-54388-7_5openalex-snapshot
Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures
inferred← citeshttps://doi.org/10.1007/978-981-96-4734-7_5openalex-snapshot
On Concrete Security Treatment of Signatures Based on Multiple Discrete Logarithms
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-007-0211-0openalex-snapshot
Formal Proofs for the Security of Signcryption
inferred← citeshttps://doi.org/10.1007/s00145-008-9028-8openalex-snapshot
Security Proofs for Identity-Based Identification and Signature Schemes
inferred← citeshttps://doi.org/10.1007/s00145-024-09525-2openalex-snapshot
Fiat–Shamir Bulletproofs are Non-malleable (in the Random Oracle Model)
inferred← citeshttps://doi.org/10.1007/s10623-004-3806-6openalex-snapshot
Signcryption with Non-interactive Non-repudiation
inferred← citeshttps://doi.org/10.1007/s10623-014-0009-7openalex-snapshot
Extended security arguments for signature schemes
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2009.01.005openalex-snapshot
Democratic group signatures with collective traceability
inferred← citeshttps://doi.org/10.1016/j.ins.2009.06.017openalex-snapshot
Certificateless Threshold Ring Signature
inferred← citeshttps://doi.org/10.1049/iet-ifs.2018.5491openalex-snapshot
Implementing confidential transactions with lattice techniques
inferred← citeshttps://doi.org/10.1049/iet-ifs:20070089openalex-snapshot
Two-tier signatures from the Fiat–Shamir transform, with applications to strongly unforgeable and one-time signatures
inferred← citeshttps://doi.org/10.1093/comjnl/bxm090openalex-snapshot
Selectively Convertible Authenticated Encryption in the Random Oracle Model
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/access.2021.3094902openalex-snapshot
Secure Threshold Ring Signature Based on SM9
inferred← citeshttps://doi.org/10.1109/csf.2012.8openalex-snapshot
Automatically Verified Mechanized Proof of One-Encryption Key Exchange
inferred← citeshttps://doi.org/10.1109/snpd.2007.210openalex-snapshot
Efficient Identity-based Signature Scheme with Partial Message Recovery
inferred← citeshttps://doi.org/10.1109/snpd.2007.250openalex-snapshot
Research on Ontology-based Representation and Retrieval of Components
inferred← citeshttps://doi.org/10.1109/tit.2008.926303openalex-snapshot
From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
inferred← citeshttps://doi.org/10.1145/3133956.3133997openalex-snapshot
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
inferred← citeshttps://doi.org/10.1145/383962.384044openalex-snapshot
Practical multi-candidate election system
inferred← citeshttps://doi.org/10.1145/501983.502017openalex-snapshot
Accountable-subgroup multisignatures
inferred← citeshttps://doi.org/10.1145/502014.502017openalex-snapshot
Accountable-subgroup multisignatures
inferred← citeshttps://doi.org/10.1155/2022/9919089openalex-snapshot
A Privacy Preserving Authentication Scheme for Heterogeneous Industrial Internet of Things
inferred← citeshttps://doi.org/10.1515/jmc.2009.004openalex-snapshot
Hash function requirements for Schnorr signatures
inferred← citeshttps://doi.org/10.2478/v10127-012-0038-4openalex-snapshot
Improved Zero-Knowledge Identification with Lattices
inferred← citeshttps://doi.org/10.26083/tuprints-00002387openalex-snapshot
Towards Efficient Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.26636/jtit.2002.4.146openalex-snapshot
Asymmetric cryptography and practical security
inferred← citeshttps://doi.org/10.3390/s25061773openalex-snapshot
A Decentralized Signcryption Scheme Based on CFL
inferred← citeshttps://doi.org/10.3837/tiis.2012.10.015openalex-snapshot
Joint Relay Selection and Resource Allocation for Cooperative OFDMA Network
inferred← citeshttps://doi.org/10.4225/03/59d4494242a38openalex-snapshot
Construction and formal security analysis of cryptographic schemes in the public key setting
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0509056openalex-snapshot
Pairing-based identification schemes
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94334openalex-snapshot
Some digital signature schemes with collective signers
inferred← citeshttps://doi.org/10.6633/ijns.200803.6(2).06openalex-snapshot
Solutions to key exposure problem in ring signature
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.