How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Existence of 3-Round Zero-Knowledge Protocols
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The random oracle methodology, revisited
Journal of the ACM (JACM)
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Invisibility and anonymity of undeniable and confirmer signatures
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
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
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
The security of the FDH variant of chaum's undeniable signature scheme
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
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
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Security analysis of the strong diffie-hellman problem
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Ring signatures: stronger definitions, and constructions without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
How to Balance Privacy with Authenticity
Information Security and Cryptology --- ICISC 2008
Universal Designated Verifier Signatures with Threshold-Signers
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Identity-based strong designated verifier signature revisited
Journal of Systems and Software
An ID-based multi-signer universal designated multi-verifier signature scheme
Information and Computation
Rigorous security requirements for designated verifier signatures
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
ISC'07 Proceedings of the 10th international conference on Information Security
Universal designated verifier signcryption
NSS'12 Proceedings of the 6th international conference on Network and System Security
A novel construction of SDVS with secure disavowability
Cluster Computing
| Hi-index | 0.00 |
Universal designated verifier signatures (UDVS) were introduced in 2003 by Steinfeld et al. to allow signature holders to monitor the verification of a given signature in the sense that any plain signature can be publicly turned into a signature which is only verifiable by some specific designated verifier. Privacy issues, like non-dissemination of digital certificates, are the main motivations to study such primitives. In this paper, we propose two fairly efficient UDVS schemes which are secure (in terms of unforgeability and anonymity) in the standard model (i.e. without random oracles). Their security relies on algorithmic assumptions which are much more classical than assumptions involved in the two only known UDVS schemes in standard model to date. The latter schemes, put forth by Zhang et al. in 2005 and Vergnaud in 2006, rely on the Strong Diffie-Hellman assumption and the strange-looking knowledge of exponent assumption (KEA). Our schemes are obtained from Waters's signature and they do not need the KEA assumption. They are also the first random oracle-free constructions with the anonymity property.