The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st 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
Efficiency improvements for signature schemes with tight security reductions
Proceedings of the 10th ACM conference on Computer and communications security
Cryptanalysis on a Proxy Multi-Signature Scheme
IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems
Journal of Cryptology
An efficient anonymous proxy signature scheme with provable security
Computer Standards & Interfaces
Secure Proxy Multi-signature Scheme in the Standard Model
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Designated verifier proxy signature scheme without random oracles
Computers & Mathematics with Applications
The exact security of digital signatures-how to sign with RSA and Rabin
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Proxy signatures secure against proxy key exposure
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
A short proxy signature scheme: efficient authentication in the ubiquitous world
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Provably secure multi-proxy signature scheme with revocation in the standard model
Computer Communications
A novel anonymous proxy signature scheme
Advances in Multimedia
Provably secure and subliminal-free variant of schnorr signature
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
| Hi-index | 0.24 |
A proxy multi-signature scheme permits two or more original singers to delegate their signing powers to the same proxy signer. Recently, Liu et al. proposed the first proxy multi-signature that be proven secure in the standard model [Liu et al. (2008) [20]], which can be viewed as a two-level hierarchical signature due to Waters. However, because of the direct employment of Waters' signature, their scheme needs a relatively large number of public parameters and is not tightly reduced to the security assumption. In this paper, inspired by Boneh, Boyen's technique and Waters' technique, we propose a new proxy multi-signature scheme without random oracles, whose unforgeability can be tightly reduced to the CDH assumption in bilinear groups. The new scheme can be regarded as an improvement to overcome the weaknesses of Liu et al.'s scheme. Compared with Liu et al.'s scheme, the improvement has three merits, tighter security reduction, shorter system parameters and higher efficiency.