On the public citation graph
Short blind signatures
0 signed · 47 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/11426639_7openalex-snapshot
Efficient Identity-Based Encryption Without Random Oracles
inferredcites →https://doi.org/10.1007/11681878_5openalex-snapshot
Efficient Blind and Partially Blind Signatures Without Random Oracles
inferredcites →https://doi.org/10.1007/11761679_26openalex-snapshot
Compact Group Signatures Without Random Oracles
inferredcites →https://doi.org/10.1007/11761679_28openalex-snapshot
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
inferredcites →https://doi.org/10.1007/11818175_4openalex-snapshot
Round-Optimal Composable Blind Signatures in the Common Reference String Model
inferredcites →https://doi.org/10.1007/3-540-44598-6_17openalex-snapshot
Provably Secure Partially Blind Signatures
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_18openalex-snapshot
Blind Signatures for Untraceable Payments
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_14openalex-snapshot
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
inferredcites →https://doi.org/10.1007/978-3-540-78967-3_24openalex-snapshot
Efficient Non-interactive Proof Systems for Bilinear Groups
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_2openalex-snapshot
Programmable Hash Functions and Their Applications
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_12openalex-snapshot
Structure-Preserving Signatures and Commitments to Group Elements
inferredcites →https://doi.org/10.1007/978-3-642-19379-8_25openalex-snapshot
Signatures on Randomizable Ciphertexts
inferredcites →https://doi.org/10.1007/978-3-642-20465-4_14openalex-snapshot
Commuting Signatures and Verifiable Encryption
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_36openalex-snapshot
Round Optimal Blind Signatures
inferredcites →https://doi.org/10.1007/978-3-642-28914-9_6openalex-snapshot
Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
inferredcites →https://doi.org/10.1007/978-3-642-28914-9_8openalex-snapshot
Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
inferredcites →https://doi.org/10.1007/978-3-642-30057-8_39openalex-snapshot
Security of Blind Signatures Revisited
inferredcites →https://doi.org/10.1007/bf02218051openalex-snapshot
An elementary proof of the local central limit theorem
inferredcites →https://doi.org/10.1007/s001450010003openalex-snapshot
Security Arguments for Digital Signatures and Blind Signatures
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1145/195058.195407openalex-snapshot
Receipt-free secret-ballot elections (extended abstract)
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-030-45724-2_3openalex-snapshot
Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_18openalex-snapshot
Efficient Signatures on Randomizable Ciphertexts
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_27openalex-snapshot
Short Pairing-Free Blind Signatures with Exponential Security
inferred← citeshttps://doi.org/10.1007/978-3-031-57718-5_1openalex-snapshot
On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-57718-5_11openalex-snapshot
Breaking Parallel ROS: Implication for Isogeny and Lattice-Based Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-68376-3_7openalex-snapshot
Pairing-Free Blind Signatures from Standard Assumptions in the ROM
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_6openalex-snapshot
Blind Signatures from Proofs of Inequality
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_7openalex-snapshot
Batched & Non-interactive Blind Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_9openalex-snapshot
Threshold Blind Signatures from CDH
inferred← citeshttps://doi.org/10.1007/978-3-319-27998-5_5openalex-snapshot
Rerandomizable Threshold Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-981-13-1483-4_7openalex-snapshot
A Methodology for Retrofitting Privacy and Its Application to e-Shopping Transactions
inferred← citeshttps://doi.org/10.1007/978-981-95-5119-4_11openalex-snapshot
Tightly-Secure Blind Signatures in Pairing-Free Groups
inferred← citeshttps://doi.org/10.1007/978-981-99-8724-5_12openalex-snapshot
Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions
inferred← citeshttps://doi.org/10.1109/iceet1.2018.8338642openalex-snapshot
Integrating E-vehicle into the power system by the execution of vehicle-to-grid (V2G) terminology — A review
inferred← citeshttps://doi.org/10.1109/mwc.2016.1600039wcopenalex-snapshot
Network Security and Privacy Challenges in Smart Vehicle-to-Grid
inferred← citeshttps://doi.org/10.1109/tits.2020.3006337openalex-snapshot
Privacy-Aware Autonomous Valet Parking: Towards Experience Driven Approach
inferred← citeshttps://doi.org/10.1109/tvt.2018.2870167openalex-snapshot
Secure Automated Valet Parking: A Privacy-Preserving Reservation Scheme for Autonomous Vehicles
inferred← citeshttps://doi.org/10.17148/ijarcce.2015.43105openalex-snapshot
Security Mediator Using Blind Signatures and Key Rotation Algorithm
inferred← citeshttps://doi.org/10.3837/tiis.2017.11.020openalex-snapshot
New Proxy Blind Signcryption Scheme for Secure Multiple Digital Messages Transmission Based on Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.48550/arxiv.1412.4707openalex-snapshot
Fair anonymity for the Tor network
inferred← citeshttps://doi.org/10.62056/a3wa3z10kopenalex-snapshot
SoK: Privacy-Preserving Signatures
inferred← citeshttps://doi.org/10.70675/67ef963ez859az430czbf2az23a0bd38ab13openalex-snapshot
Transferable e-cash : an analysis in the algebraic group model
inferred← citeshttps://doi.org/10.70675/6cfbaf7cz18b4z429dzbef8z5a05dc684a02openalex-snapshot
Constructions of advanced cryptographic primitives
inferred← citeshttps://doi.org/10.70675/6eb45a24z8757z4c61za4eez93f26adb3bcaopenalex-snapshot
The security of the one-more discrete-logarithm assumption and blind Schnorr signatures
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.