On the public citation graph
Security of blind digital signatures
0 signed · 211 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/0-387-34799-2_15openalex-snapshot
How To Sign Given Any Trapdoor Function
inferredcites →https://doi.org/10.1007/0-387-34805-0_13openalex-snapshot
Bit Commitment Using Pseudo-Randomness
inferredcites →https://doi.org/10.1007/0-387-34805-0_19openalex-snapshot
New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs
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-45961-8_11openalex-snapshot
A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory
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-48071-4_16openalex-snapshot
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent
inferredcites →https://doi.org/10.1007/3-540-48071-4_3openalex-snapshot
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-48658-5_23openalex-snapshot
An Efficient Existentially Unforgeable Signature Scheme and its Applications
inferredcites →https://doi.org/10.1007/3-540-59175-3_86openalex-snapshot
Off-line electronic cash based on secret-key certificates
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/978-1-4757-0602-4_18openalex-snapshot
Blind Signatures for Untraceable Payments
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bfb0034852openalex-snapshot
Provably secure blind signature schemes
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
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/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/ett.3167openalex-snapshot
Efficient message recovery proxy blind signature scheme from pairings
inferred← citeshttps://doi.org/10.1002/sec.1344openalex-snapshot
Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing
inferred← citeshttps://doi.org/10.1002/sec.371openalex-snapshot
Practical round‐optimal blind signatures without random oracles or non‐interactive zero‐knowledge proofs
inferred← citeshttps://doi.org/10.1007/11596219_28openalex-snapshot
A Universally Composable Scheme for Electronic Cash
inferred← citeshttps://doi.org/10.1007/11596981_17openalex-snapshot
ID-Based Restrictive Partially Blind Signatures
inferred← citeshttps://doi.org/10.1007/11596981_24openalex-snapshot
Pairing-Based Provable Blind Signature Scheme Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11605805_17openalex-snapshot
On the (Im)possibility of Blind Message Authentication Codes
inferred← citeshttps://doi.org/10.1007/11610113_28openalex-snapshot
Role-Based Delegation with Negative Authorization
inferred← citeshttps://doi.org/10.1007/11681878_5openalex-snapshot
Efficient Blind and Partially Blind Signatures Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11751595_38openalex-snapshot
Efficient Partially Blind Signatures with Provable Security
inferred← citeshttps://doi.org/10.1007/11818175_4openalex-snapshot
Round-Optimal Composable Blind Signatures in the Common Reference String Model
inferred← citeshttps://doi.org/10.1007/11832072_4openalex-snapshot
Concurrent Blind Signatures Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11889663_21openalex-snapshot
Efficient Provably Secure Restrictive Partially Blind Signatures from Bilinear Pairings
inferred← citeshttps://doi.org/10.1007/11935230_12openalex-snapshot
On the Generic Construction of Identity-Based Signatures with Additional Properties
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_33openalex-snapshot
ID-Based Blind Signature and Ring Signature from Pairings
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-44987-6_9openalex-snapshot
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_27openalex-snapshot
Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings
inferred← citeshttps://doi.org/10.1007/3-540-45598-1_13openalex-snapshot
Enabling Privacy Protection in E-commerce Applications
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_7openalex-snapshot
A Provably Secure Restrictive Partially Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_34openalex-snapshot
Provably Secure air Blind Signatures with Tight Revocation
inferred← citeshttps://doi.org/10.1007/3-540-46088-8_25openalex-snapshot
The Power of RSA Inversion Oracles and the Security of Chaum’s RSA-Based Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-48390-x_3openalex-snapshot
Trustee Tokens: Simple and Practical Anonymous Digital Coin Tracing
inferred← citeshttps://doi.org/10.1007/3-540-48390-x_4openalex-snapshot
Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-15032-7_106openalex-snapshot
Deniable Secret Handshake Protocol - Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-29962-0_19openalex-snapshot
Location Privacy-Preserving Mobile Crowd Sensing with Anonymous Reputation
inferred← citeshttps://doi.org/10.1007/978-3-030-31729-4_10openalex-snapshot
Trust-Based Access Control Management in Collaborative Open Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-31729-4_12openalex-snapshot
Effective Collaboration with Information Sharing in Virtual Universities
inferred← citeshttps://doi.org/10.1007/978-3-030-31729-4_13openalex-snapshot
Distributed Access Control Through Blockchain Technology
inferred← citeshttps://doi.org/10.1007/978-3-030-31729-4_2openalex-snapshot
Electronic Commerce Items and Related Technology
inferred← citeshttps://doi.org/10.1007/978-3-030-31729-4_8openalex-snapshot
Role-Based Delegation with Negative Authorization
inferred← citeshttps://doi.org/10.1007/978-3-030-31729-4_9openalex-snapshot
Access Control Management for Ubiquitous Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-51280-4_26openalex-snapshot
BLAZE: Practical Lattice-Based Blind Signatures for Privacy-Preserving Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-55304-3_3openalex-snapshot
On Lattice-Based Interactive Protocols: An Approach with Less or No Aborts
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_18openalex-snapshot
Lattice-Based Blind Signatures, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-61078-4_11openalex-snapshot
Blind Functional Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-68884-4_48openalex-snapshot
An Efficient Blind Signature Scheme with Untraceability for Data Privacy in Smart Grid
inferred← citeshttps://doi.org/10.1007/978-3-030-71852-7_25openalex-snapshot
An Efficient Blind Signature Scheme Based on SM2 Signature Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-92068-5_16openalex-snapshot
Boosting the Security of Blind Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-92548-2_6openalex-snapshot
BlindOR: an Efficient Lattice-Based Blind Signature Scheme from OR-Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-97131-1_16openalex-snapshot
On Pairing-Free Blind Signature Schemes in the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_1openalex-snapshot
PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_10openalex-snapshot
The Abe-Okamoto Partially Blind Signature Scheme Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_25openalex-snapshot
Non-interactive Blind Signatures for Random Messages
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_26openalex-snapshot
Rai-Choo! Evolving Blind Signatures to the Next Level
inferred← citeshttps://doi.org/10.1007/978-3-031-31368-4_10openalex-snapshot
Security Analysis of RSA-BSSA
inferred← citeshttps://doi.org/10.1007/978-3-031-58723-8_5openalex-snapshot
Concurrently Secure Blind Schnorr Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-68376-3_5openalex-snapshot
Solving the Tensor Isomorphism Problem for Special Orbits with Low Rank Points: Cryptanalysis and Repair of an Asiacrypt 2023 Commitment Scheme
inferred← citeshttps://doi.org/10.1007/978-3-031-68376-3_6openalex-snapshot
Pairing-Free Blind Signatures from CDH Assumptions
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-031-82852-2_10openalex-snapshot
Multivariate Blind Signatures Revisited
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_16openalex-snapshot
Improved Lattice Blind Signatures from Recycled Entropy
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-35415-0_13openalex-snapshot
Playing Tag with Okamoto-Schnorr: Three-Move Pairing-Free Blind Signatures from DDH
inferred← citeshttps://doi.org/10.1007/978-3-032-35415-0_17openalex-snapshot
Round-Optimal GUC-Secure Blind Signatures From Minimal Computational and Setup Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-032-35428-0_19openalex-snapshot
$$\textsf{SMA}^2\textsf{RT}$$: Secret-Metadata Attribute-Based Anonymous Rate-Limited Tokens
inferred← citeshttps://doi.org/10.1007/978-3-319-16745-9_1openalex-snapshot
An Efficient Privacy-Preserving E-coupon System
inferred← citeshttps://doi.org/10.1007/978-3-319-19713-5_36openalex-snapshot
Non-conventional Digital Signatures and Their Implementations—A Review
inferred← citeshttps://doi.org/10.1007/978-3-319-27998-5_5openalex-snapshot
Rerandomizable Threshold Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-44618-9_21openalex-snapshot
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-45572-3_2openalex-snapshot
Practical Signing-Right Revocation
inferred← citeshttps://doi.org/10.1007/978-3-319-70972-7_25openalex-snapshot
A Practical Multivariate Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-70972-7_26openalex-snapshot
Efficient Round-Optimal Blind Signatures in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-319-98989-1_18openalex-snapshot
Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker
inferred← citeshttps://doi.org/10.1007/978-3-319-99807-7_21openalex-snapshot
DSH: Deniable Secret Handshake Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-30598-9_10openalex-snapshot
Efficient Blind Signatures Without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-540-39927-8_2openalex-snapshot
A Forward-Secure Blind Signature Scheme Based on the Strong RSA Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-45126-6_3openalex-snapshot
On the Anonymity of Fair Offline E-cash Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_6openalex-snapshot
On Cryptographic Assumptions and Challenges
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-70630-4_13openalex-snapshot
Reputation Systems for Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_15openalex-snapshot
A Provably Secure Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_33openalex-snapshot
Simulatable Adaptive Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-540-73489-5_14openalex-snapshot
Fair Blind Signatures Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_7openalex-snapshot
Universally-Composable Two-Party Computation in Two Rounds
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-78524-8_19openalex-snapshot
Equivocal Blind Signatures and Adaptive UC-Security
inferred← citeshttps://doi.org/10.1007/978-3-540-79104-1_4openalex-snapshot
1-out-of-n Oblivious Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_8openalex-snapshot
Round-Optimal Blind Signatures from Waters Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_17openalex-snapshot
Security of Blind Signatures under Aborts
inferred← citeshttps://doi.org/10.1007/978-3-642-02002-5_7openalex-snapshot
Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
inferred← citeshttps://doi.org/10.1007/978-3-642-03168-7_12openalex-snapshot
APOD: Anonymous Physical Object Delivery
inferred← citeshttps://doi.org/10.1007/978-3-642-03298-1_9openalex-snapshot
Compact E-Cash and Simulatable VRFs Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-03748-1_5openalex-snapshot
An Anonymous Credit Card System
inferred← citeshttps://doi.org/10.1007/978-3-642-10230-1_2openalex-snapshot
Unconditionally Secure Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_26openalex-snapshot
A Framework for Universally Composable Non-committing Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_3openalex-snapshot
Fair Partially Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_10openalex-snapshot
On the Impossibility of Three-Move Blind Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_22openalex-snapshot
Proof-of-Knowledge of Representation of Committed Value and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-14171-3_34openalex-snapshot
A Bilinear Pairing Based Hidden-Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_24openalex-snapshot
Lattice-Based Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_30openalex-snapshot
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-17955-6_12openalex-snapshot
Hidden Credential Retrieval without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_37openalex-snapshot
Impossibility of Blind Signatures from One-Way Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_36openalex-snapshot
Round Optimal Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-25206-8_13openalex-snapshot
Flexible Anonymous Subscription Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_8openalex-snapshot
Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_39openalex-snapshot
Security of Blind Signatures Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-33383-5_17openalex-snapshot
Efficient Two-Move Blind Signatures in the Common Reference String Model
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_23openalex-snapshot
Formalizing Group Blind Signatures and Practical Constructions without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-45239-0_18openalex-snapshot
Sub-linear Blind Ring Signatures without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_27openalex-snapshot
Efficient Round Optimal Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-662-45608-8_20openalex-snapshot
Black-Box Separations for One-More (Static) CDH and Its Generalization
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_12openalex-snapshot
Practical Round-Optimal Blind Signatures in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_22openalex-snapshot
Two-Message, Oblivious Evaluation of Cryptographic Functionalities
inferred← citeshttps://doi.org/10.1007/978-3-662-58820-8_15openalex-snapshot
Towards Everlasting Privacy and Efficient Coercion Resistance in Remote Electronic Voting
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-96-0875-1_12openalex-snapshot
Practical 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.1007/978-981-99-8739-9_8openalex-snapshot
Non-interactive Commitment from Non-transitive Group Actions
inferred← citeshttps://doi.org/10.1007/bfb0052227openalex-snapshot
On the foundations of modern cryptography
inferred← citeshttps://doi.org/10.1007/bfb0054141openalex-snapshot
Strengthened security for blind signatures
inferred← citeshttps://doi.org/10.1007/bfb0055483openalex-snapshot
Group blind digital signatures: A scalable solution to electronic cash
inferred← citeshttps://doi.org/10.1007/s00145-002-0120-1openalex-snapshot
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/s00145-014-9196-7openalex-snapshot
Structure-Preserving Signatures and Commitments to Group Elements
inferred← citeshttps://doi.org/10.1007/s00145-015-9225-1openalex-snapshot
Security of Blind Signatures Revisited
inferred← citeshttps://doi.org/10.1007/s001450010003openalex-snapshot
Security Arguments for Digital Signatures and Blind Signatures
inferred← citeshttps://doi.org/10.1007/s10207-013-0191-zopenalex-snapshot
Anonymous attestation with user-controlled linkability
inferred← citeshttps://doi.org/10.1007/s10207-019-00457-8openalex-snapshot
An improved FOO voting scheme using blockchain
inferred← citeshttps://doi.org/10.1007/s10586-025-05568-7openalex-snapshot
A data sharing scheme for IoT devices based on blockchain and zk-SNARK
inferred← citeshttps://doi.org/10.1007/s11042-019-7730-1openalex-snapshot
Modelling a side channel resistant CHAN-PKC cryptomata for medical data security
inferred← citeshttps://doi.org/10.1007/s11235-016-0201-3openalex-snapshot
Efficient E-coupon systems with strong user privacy
inferred← citeshttps://doi.org/10.1007/s11704-023-2372-xopenalex-snapshot
BSKCN and BSAML: blind signatures from the module lattice and the asymmetric module lattice
inferred← citeshttps://doi.org/10.1007/s11859-013-0903-2openalex-snapshot
A proxy blind signature scheme and an off-line electronic cash scheme
inferred← citeshttps://doi.org/10.1007/s12083-020-01044-8openalex-snapshot
Blind signcryption scheme based on hyper elliptic curves cryptosystem
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.05.021openalex-snapshot
Achieving liability in anonymous communication: Auditing and tracing
inferred← citeshttps://doi.org/10.1016/j.future.2007.07.011openalex-snapshot
Access control management for ubiquitous computing
inferred← citeshttps://doi.org/10.1016/j.future.2017.01.031openalex-snapshot
A round-optimal lattice-based blind signature scheme for cloud services
inferred← citeshttps://doi.org/10.1016/j.ins.2020.08.032openalex-snapshot
An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
inferred← citeshttps://doi.org/10.1016/j.mcm.2012.06.003openalex-snapshot
Multi-recastable e-bidding game with dual-blindness
inferred← citeshttps://doi.org/10.1049/2024/6656367openalex-snapshot
An Efficient Code‐Based One‐Time Blind Signature Scheme for Electronic Forensics
inferred← citeshttps://doi.org/10.1049/iet-ifs.2017.0082openalex-snapshot
Delegatable functional signatures
inferred← citeshttps://doi.org/10.1049/iet-ifs.2017.0342openalex-snapshot
Efficient identity‐based blind message recovery signature scheme from pairings
inferred← citeshttps://doi.org/10.1049/iet-ifs.2019.0156openalex-snapshot
Leakage‐resilient lattice‐based partially blind signatures
inferred← citeshttps://doi.org/10.1109/access.2018.2827203openalex-snapshot
A Secure Cryptocurrency Scheme Based on Post-Quantum Blockchain
inferred← citeshttps://doi.org/10.1109/access.2018.2833103openalex-snapshot
A New Post-Quantum Blind Signature From Lattice Assumptions
inferred← citeshttps://doi.org/10.1109/access.2019.2904146openalex-snapshot
New Construction of Blind Signatures From Braid Groups
inferred← citeshttps://doi.org/10.1109/access.2019.2959943openalex-snapshot
Identity-Based Blind Multisignature From Lattices
inferred← citeshttps://doi.org/10.1109/chinacom.2006.344757openalex-snapshot
ACJT Group Blind Signature Scheme
inferred← citeshttps://doi.org/10.1109/comst.2017.2718178openalex-snapshot
Privacy-Preserving Schemes for Ad Hoc Social Networks: A Survey
inferred← citeshttps://doi.org/10.1109/eidwt.2013.79openalex-snapshot
An Efficient Provably Secure Certificate-Based Blind Signature Scheme
inferred← citeshttps://doi.org/10.1109/ias.2009.10openalex-snapshot
An Optimal Blind Signature Padding with Message Recovery
inferred← citeshttps://doi.org/10.1109/icdcsw.2015.30openalex-snapshot
Security and Privacy of Distributed Online Social Networks
inferred← citeshttps://doi.org/10.1109/ictta.2008.4529987openalex-snapshot
Wallet Based E-Cash System for Secured Multi-hop Cash Exchange
inferred← citeshttps://doi.org/10.1109/msp.2015.21openalex-snapshot
An Overview of ANONIZE: A Large-Scale Anonymous Survey System
inferred← citeshttps://doi.org/10.1109/ncis.2011.56openalex-snapshot
Secure ID-Based Blind Signature Scheme without Random Oracle
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646120openalex-snapshot
New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)
inferred← citeshttps://doi.org/10.1109/snpd.2007.101openalex-snapshot
Throughput Performance of Marine STDMA Ad-hoc Network
inferred← citeshttps://doi.org/10.1109/sp.2014.31openalex-snapshot
ANONIZE: A Large-Scale Anonymous Survey System
inferred← citeshttps://doi.org/10.1109/tdsc.2009.50openalex-snapshot
SAT: A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/tifs.2024.3523202openalex-snapshot
An Efficient Privacy-Preserving Scheme for Weak Password Collection in Internet of Things Against Perpetual Leakage
inferred← citeshttps://doi.org/10.1109/tifs.2025.3565371openalex-snapshot
Threshold Password-Hardening Updatable Oblivious Key Management
inferred← citeshttps://doi.org/10.1109/tkde.2008.132openalex-snapshot
Effective Collaboration with Information Sharing in Virtual Universities
inferred← citeshttps://doi.org/10.1137/s0097539704383633openalex-snapshot
Oblivious Polynomial Evaluation
inferred← citeshttps://doi.org/10.1145/1455770.1455786openalex-snapshot
Computational soundness of observational equivalence
inferred← citeshttps://doi.org/10.1145/3548606.3560650openalex-snapshot
Practical, Round-Optimal Lattice-Based Blind Signatures
inferred← citeshttps://doi.org/10.1145/3576915.3623184openalex-snapshot
Concurrent Security of Anonymous Credentials Light, Revisited
inferred← citeshttps://doi.org/10.1360/ssi-2024-0376openalex-snapshot
An efficient blind signature scheme based on (U,U+V) codes
inferred← citeshttps://doi.org/10.1504/ijmor.2016.073280openalex-snapshot
A proxy partially blind signature approach using elliptic curve cryptosystem
inferred← citeshttps://doi.org/10.17559/tv-20150314122306openalex-snapshot
Making reputation system traceable without losing privacy
inferred← citeshttps://doi.org/10.22029/jlupub-9581openalex-snapshot
Langfristig sichere elektronische Geldsysteme mit Observern
inferred← citeshttps://doi.org/10.26083/tuprints-00002376openalex-snapshot
On the Complexity of Blind Signatures
inferred← citeshttps://doi.org/10.3233/jcs-181270openalex-snapshot
Publicly auditable conditional blind signatures
inferred← citeshttps://doi.org/10.32469/10355/79561openalex-snapshot
Machine-aided analysis of vote privacy using computationally complete symbolic attacker
inferred← citeshttps://doi.org/10.32657/10356/4194openalex-snapshot
Efficient group signature and identity-based signature schemes
inferred← citeshttps://doi.org/10.3390/app15052864openalex-snapshot
Privacy Illusion: Subliminal Channels in Schnorr-like Blind-Signature Schemes
inferred← citeshttps://doi.org/10.3906/elk-1102-1051openalex-snapshot
A blind digital signature scheme using elliptic curve digital signature algorithm
inferred← citeshttps://doi.org/10.3934/amc.2010.4.453openalex-snapshot
On the generic construction of identity-based signatures with additional properties
inferred← citeshttps://doi.org/10.3934/amc.2018002openalex-snapshot
Private set-intersection with common set-up
inferred← citeshttps://doi.org/10.4172/2090-4908.1000158openalex-snapshot
A New Cryptographic Voting Verifiable Scheme for E-Voting System Based on Bit Commitment and Blind Signature
inferred← citeshttps://doi.org/10.4230/dagsemproc.09221.3openalex-snapshot
Lattice-based Blind Signatures
inferred← citeshttps://doi.org/10.62056/a3qj5w7sfopenalex-snapshot
Unforgeability of Blind Schnorr in the Limited Concurrency Setting
inferred← citeshttps://doi.org/10.62056/a3wa3z10kopenalex-snapshot
SoK: Privacy-Preserving Signatures
inferred← citeshttps://doi.org/10.6633/ijns.201107.13(1).06openalex-snapshot
A Stamped Hidden-signature Scheme Utilizing The Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.70675/6cfbaf7cz18b4z429dzbef8z5a05dc684a02openalex-snapshot
Constructions of advanced cryptographic primitives
inferred← citeshttps://doi.org/10.70675/81076851zf805z47dez9a3az15f761e0669aopenalex-snapshot
Functional encryption for blind external data processing
inferred← citeshttps://doi.org/10.70675/d03f988az855ez47e4za799zcea647d2f90copenalex-snapshot
Privacy preserving post-quantum cryptography
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.