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
SIAM Journal on Computing
On the Exact Security of Full Domain Hash
CRYPTO '00 Proceedings of the 20th 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
Short Signatures from the Weil Pairing
Journal of Cryptology
Universal Designated Multi Verifier Signature Schemes
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Journal of Cryptology
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Universally convertible directed signatures
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A new security proof for damgård’s elgamal
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
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
Verifier-key-flexible universal designated-verifier signatures
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
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
Rigorous security requirements for designated verifier signatures
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Universal designated verifier signature without delegatability
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
A new strong multiple designated verifiers signature
International Journal of Grid and Utility Computing
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
Designated verifier signature: definition, framework and new constructions
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
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
How to achieve non-repudiation of origin with privacy protection in cloud computing
Journal of Computer and System Sciences
A novel construction of SDVS with secure disavowability
Cluster Computing
| Hi-index | 0.00 |
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. We propose two new efficient constructions for pairing-based short signatures. The first scheme is based on Boneh-Boyen signatures and, its security can be analyzed in the standard security model. We reduce its resistance to forgery to the hardness of the strong Diffie-Hellman problem, under the knowledge-of-exponent assumption. The second scheme is compatible with the Boneh-Lynn-Shacham signatures and is proven unforgeable, in the random oracle model, under the assumption that the computational bilinear Diffie-Hellman problem is untractable. Both schemes are designed for devices with constrained computation capabilities since the signing and the designation procedure are pairing-free