How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Designated verifier signatures: anonymity and efficient construction from any bilinear map
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Rogue-key attacks on the multi-designated verifiers signature scheme
Information Processing Letters
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
ProvSec'10 Proceedings of the 4th international conference on Provable security
An ID-based multi-signer universal designated multi-verifier signature scheme
Information and Computation
A new strong multiple designated verifiers signature
International Journal of Grid and Utility Computing
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
(Strong) multi-designated verifiers signatures secure against rogue key attack
NSS'12 Proceedings of the 6th international conference on Network and System Security
| Hi-index | 0.89 |
In 1996, Jakobsson, Sako, and Impagliazzo and, on the other hand, Chaum proposed the notion of designated verifier signature to solve some of the intrinsic problems of undeniable signatures. The generalization of this concept, suggested by Desmedt at Crypto'03's rump session, was formally investigated by Laguillaumie and Vergnaud at ICICS'04 as multi-designated verifiers signatures. The protection of the signer's privacy, as defined in that paper, seems difficult to achieve, and the protocols they proposed capture this property with an IND-CCA2 encryption of the signature. In this article, we propose the first multi-designated verifiers signature scheme which protects the anonymity of signers without encryption. This scheme is designed to be the extension of their B2DVS one and relies on Boneh et al.'s pairing-based ring signatures. The security of the new protocol relies, in the random oracle model, on the difficulty of solving the Diffie-Hellman problem in a bilinear setting.