Proxy signatures for delegating signing operation
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Introduction to cryptography: principles and applications
Introduction to cryptography: principles and applications
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
An Anonymous Electronic Voting Protocol for Voting Over The Internet
WECWIS '01 Proceedings of the Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS '01)
Cryptography and Network Security (4th Edition)
Cryptography and Network Security (4th Edition)
A novel ID-based designated verifier signature scheme
Information Sciences: an International Journal
A novel identity-based strong designated verifier signature scheme
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
Computers and Electrical Engineering
Short designated verifier proxy signature from pairings
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Hi-index | 0.00 |
A proxy signature (PS) scheme has crucial benefits to the delegation operations in an organization. To further provide PS schemes with the property of confidentiality, in this paper, we propose a strong designated verifier PS scheme from pairings. The proposed scheme allows an authorized proxy signer to generate a valid PS on behalf of an original signer such that only the intended verifier is capable of validating it. Besides, the designated verifier cannot transfer the proof to convince any third party, which is referred to as non-transferability. Compared with previous works, ours has lower computational costs. Especially, the delegation process of our proposed scheme is pairing free. Moreover, the security requirement of unforgeability against existential forgery under adaptive chosen-message attacks is formally proven in the random oracle model. Copyright © 2011 John Wiley & Sons, Ltd.