A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
Theoretical Computer Science
A novel ID-based designated verifier signature scheme
Information Sciences: an International Journal
A non-interactive deniable authentication scheme based on designated verifier proofs
Information Sciences: an International Journal
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
A Schnorr-Like Lightweight Identity-Based Signature Scheme
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Unifying Zero-Knowledge Proofs of Knowledge
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Identity-based strong designated verifier signature revisited
Journal of Systems and Software
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
Identity-based strong multi-designated verifiers signatures
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
International Journal of Information 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
New directions in cryptography
IEEE Transactions on Information Theory
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
Strong designated verifier signature (SDVS) is characterized by two properties; namely the non-transferability and the privacy of the signer's identity (PSI). Non-transferability prevents anyone else other than the designated verifier to verify the signature, while PSI prevents a third party to distinguish between two different signers. In this paper, we propose a non-delegatable SDVS which uses a trusted third party for the key generation. Our signature scheme does not use bilinear pairings which makes it suitable for the resource constraint applications. Using one-way homomorphic functions, our scheme is presented at an abstract level, the unification of which was noticed by Maurer in the context of zero knowledge proofs of knowledge in Africacrypt 2009. The security of the proposed scheme is proved in the random oracle model, provided that the homomorphism one-wayness and the gap Diffie-Hellman assumptions hold. When a Schnorr-like homomorphism is used to construct our scheme, six exponentiations are needed in the signing step and seven for the verification step. This means a meaningful gap between the performance of our scheme and that of its predecessors which use pairings in their signing and/or verification steps.