Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
A security architecture for computational grids
CCS '98 Proceedings of the 5th 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
Disallowing Unauthorized State Changes of Distributed Shared Objects
Proceedings of the IFIP TC11 Fifteenth Annual Working Conference on Information Security for Global Information Infrastructures
A Law-Abiding Peer-to-Peer Network for Free-Software Distribution
NCA '01 Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA'01)
Improvement of Multi-Proxy Signature Scheme
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Formalized Security Model of Multi-Proxy Signature Schemes
CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
Certificateless signature: a new security model and an improved generic construction
Designs, Codes and Cryptography
Simulatability and security of certificateless threshold signatures
Information Sciences: an International Journal
Malicious KGC attacks in certificateless cryptography
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Generic Constructions of Identity-Based and Certificateless KEMs
Journal of Cryptology
Efficient and provably-secure certificateless short signature scheme from bilinear pairings
Computer Standards & Interfaces
A secure identity-based multi-proxy signature scheme
Computers and Electrical Engineering
Efficient and Short Certificateless Signature
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
A new certificateless aggregate signature scheme
Computer Communications
Certificateless signcryption scheme in the standard model
Information Sciences: an International Journal
Certificateless signature revisited
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Reducing trust in the PKG in identity based cryptosystems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Multi-proxy signature and proxy multi-signature schemes from bilinear pairings
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Multi-proxy signatures based on diffie-hellman problems allowing repeated delegations
HSI'05 Proceedings of the 3rd international conference on Human Society@Internet: web and Communication Technologies and Internet-Related Social Issues
Efficient certificateless proxy signature scheme with provable security
Information Sciences: an International Journal
Cryptanalysis of a certificateless multi-proxy signature scheme
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Cryptanalysis and improvement of a certificateless threshold signature secure in the standard model
Information Sciences: an International Journal
Hi-index | 0.25 |
Multi-proxy signature is a scheme that an original signer authorizes a proxy group as his proxy agent and later only the cooperation of all proxy signers in the proxy group could sign messages on behalf of the original signer. To our best knowledge, most of the existing multi-proxy signature schemes are proposed in public key infrastructure or identity-based setting. However, due to avoiding the inherent escrow problem of identity-based cryptography and yet not requiring certificates to guarantee the authenticity of public keys, certificateless public key cryptography has become an attractive paradigm on which many cryptographical primitives are based. In this paper, a generic construction and a formal security model of certificateless multi-proxy signature (CLMPS) are firstly defined. A concrete CLMPS scheme is also proposed, which is proven to be existentially unforgeable against adaptively chosen warrant attacks and chosen message and identity attacks in the random oracle model under the computational Diffie-Hellman assumption.