Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A novel ID-based designated verifier signature scheme
Information Sciences: an International Journal
Secure universal designated verifier signature without random oracles
International Journal of Information Security
A novel identity-based strong designated verifier signature scheme
Journal of Systems and Software
An identity based universal designated verifier signature scheme secure in the standard model
Journal of Systems and Software
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Universal designated verifier signature without delegatability
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
New extensions of pairing-based signatures into universal designated verifier signatures
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Universal designated verifier signature proof (or how to efficiently prove knowledge of a signature)
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Designated verifier signature schemes: attacks, new security notions and a new construction
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Short signature and universal designated verifier signature without random oracles
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Designated verifier signatures: anonymity and efficient construction from any bilinear map
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
On delegatability of four designated verifier signatures
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Universal designated verifier signatures without random oracles or non-black box assumptions
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Group-oriented fair exchange of signatures
Information Sciences: an International Journal
Dual-verifiers DVS with message recovery for tolerant routing in wireless sensor networks
PAISI'11 Proceedings of the 6th Pacific Asia conference on Intelligence and security informatics
A short non-delegatable strong designated verifier signature
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Non-delegatable strong designated verifier signature on elliptic curves
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Non-delegatable strong designated verifier signature using a trusted third party without pairings
AISC '13 Proceedings of the Eleventh Australasian Information Security Conference - Volume 138
A novel construction of SDVS with secure disavowability
Cluster Computing
| Hi-index | 0.00 |
Abstract: Designated verifier signature (DVS) allows the signer to persuade a verifier the validity of a statement but prevent the verifier from transferring the conviction. Strong designated verifier signature (SDVS) is a variant of DVS, which only allows the verifier to privately check the validity of the signer's signature. In this work we observe that the unforgeability model considered in the existing identity-based SDVS schemes is not strong enough to capture practical attacks, and propose to consider another model which is shown to be strictly stronger than the old one. We then propose a new efficient construction of identity-based SDVS scheme, which is provably unforgeable under the newly proposed definition, based on the hardness of Computational Diffie-Hellman problem in the random oracle model. Our scheme is perfectly non-transferable in the sense that the signer and the designated verifier can produce identically distributed signatures on the same message. Besides, it is the first IBSDVS scheme that is non-delegatable with respect to (an identity-based variant of) the definition proposed by Lipmaa et al. (ICALP 2005).