A systematic method to design strong designated verifier signature without random oracles

Authors:
Haibo Tian;Zhengtao Jiang;Yi Liu;Baodian Wei
Affiliations:
School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, P.R. China 510275 and Guangdong Key Laboratory of Information Security Technology, Guangzhou, P.R. China;School of Computer, Communication University of China, Beijing, China 100024;Faculty of Computer, Guangdong University of Technology, Guangzhou, P.R. China 510006;School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, P.R. China 510275 and Guangdong Key Laboratory of Information Security Technology, Guangzhou, P.R. China
Venue:
Cluster Computing
Year:
2013

Citing 15
Cited 0

Algorithms for Multi-exponentiation

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Modern Cryptography: Theory and Practice

Modern Cryptography: Theory and Practice
An Efficient Designated Verifier Signature Scheme without Random Oracles

ISDPE '07 Proceedings of the The First International Symposium on Data, Privacy, and E-Commerce
An identity based universal designated verifier signature scheme secure in the standard model

Journal of Systems and Software
A new public-key encryption scheme

Journal of Computer Science and Technology
Designated verifier proofs and their applications

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Rigorous security requirements for designated verifier signatures

Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
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
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
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
Strongly unforgeable signatures based on computational diffie-hellman

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A Non-delegatable Strong Designated Verifier Signature without Random Oracles

INCOS '12 Proceedings of the 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Strong designated verifier signature (SDVS) provides secret authentication service to entities in a computing task. The primitive assures that an entity's signature is verified only by a designated service provider. It also assures that a transcript about a computing task can be produced by both the entity and its service provider independently. Then neither can prove to a third party that an entity is involved in a task. Currently, most SDVS schemes without random oracles have no strong unforgeability and privacy of signer's identity. This paper proposes a systematic method to design SDVS schemes without random oracles. It provides a basic scheme with unforgeability and non-transferability properties. Then provides it an SDVS scheme with strong unforgeability and privacy of signer's identity properties and based on standard assumptions. Finally, a more efficient SDVS scheme is shown based on a non-black box assumption.