A new certificateless signature with enhanced security and aggregation version

Deng, Jiang; Xu, Chunxiang; Wu, Huai; Dong, Liju

doi:10.1002/cpe.3551

Cited by 16 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, Shen et al [22] pointed out that the scheme [5] is vulnerable. Deng et al [8] proposed a new CLAS scheme with a constant number of pairing operations. Deng et al [10] constructed another CLAS scheme and gave the security proofs based on RSA and discrete logarithm problem.…”

Section: A Related Workmentioning

confidence: 99%

“…Cheng et al's scheme [6] Follow on, the size of signature are computed. In these three schemes [6], [8], [18], each signature contains n + 1 points in G 1 , thus the signature size is (512 × 1001)/8 = 64064 bytes. In the schemes [19], each signature contains 2 points in G 1 and 2 state information, thus the signature size is (512×2+160×2)/8 = 168 bytes.…”

Section: Efficiencymentioning

confidence: 99%

See 1 more Smart Citation

Certificateless Short Aggregate Signature Scheme for Mobile Devices

2019

View full text Add to dashboard Cite

Today, data is exploding. A large amount of data needs to be processed in a timely and an efficient manner. Aggregate signatures are an efficient and secure way to handle large numbers of digital signatures. In an aggregate signature scheme, n signatures on n messages from n users can be combined into a single signature, which can make anyone believes that the n messages were indeed signed by the n corresponding users. In the recent decade, numerous certificateless aggregate signature (CLAS) schemes have been introduced. In most CLAS schemes currently known, the number of hash-to-point operations and the size of signature increase linearly with the number of signers, so they are not suitable for computing restricted devices, such as mobile devices. In this paper, a new CLAS scheme is constructed, which requires only two pairing operations and the signature contains only one point and state information. It is more efficient than the previous ones and suit for the mobile devices.INDEX TERMS Certificateless cryptography, short signature, aggregate signature, pairing, random oracles model.

show abstract

Section: A Related Workmentioning

confidence: 99%

Section: Efficiencymentioning

confidence: 99%

Certificateless Short Aggregate Signature Scheme for Mobile Devices

2019

View full text Add to dashboard Cite

show abstract

“…Certificateless aggregate signature schemes are required to satisfy the applications in certificateless environment. In the fourth paper, ‘A New Certificateless Signature with Enhanced Security and Aggregation Version’ , Deng et al present an improved certificateless signature scheme and use it to construct a new certificateless signature scheme with enhanced security and aggregation. Compared with other schemes, the proposed scheme is more suitable for realistic applications.…”

Section: This Special Issuementioning

confidence: 99%

Recent advances in security and privacy in large‐scale networks

et al. 2016

Concurrency and Computation

View full text Add to dashboard Cite

THIS SPECIAL ISSUEWe are pleased to present to you 13 technical papers dealing with cutting-edge research and technology related to this topic. These papers were selected out of the significantly extended versions of the 149 submissions from 18 countries in the 3rd IEEE International Workshop on Large-Scale Network Security (LSNS 2014) and a large number of open submissions. The selection has been very rigorous, and only the best papers were selected.In the first paper, 'An Error-Tolerant Keyword Search Scheme Based on Public-Key Encryption in Secure Cloud Computing' [1], Yang et al. first present a general framework for searching on errortolerant keywords based on a public-key encryption scheme. Then a concrete scheme is proposed based on the Cramer-Shoup cryptosystem. The scheme is chosen ciphertext attack secure, and suitable for all similarity metrics including Hamming distance metric, edit distance metric, and set difference metric. Because it does not require the user to construct and store anything in advance, very different from those cryptosystems used to calculate the trapdoor of keywords and to encrypt data documents, the new scheme tremendously eases the users' burden.In the second paper, 'A Lightweight Privacy-Preserving Scheme with Data Integrity for Smart Grid Communications' [2], Bao and Chen propose a lightweight data report scheme for smart grid communications, which can achieve privacy preservation and data integrity simultaneously. Specifically, an efficient pseudonym identity-based privacy-preserving report approach is proposed for the control center to obtain the fine-grained usage data of all the users while protecting user's privacy. An online/offline hash tree-based mechanism is also designed to check and assure data integrity of communications. Furthermore, a topology-independent data report architecture is also structured, which is adaptable for dynamic residential users to spontaneously form clusters and efficiently report data in flocks. Extensive performance evaluation demonstrates that the proposed scheme can achieve less communication overhead and dramatically reduce computational cost in comparison with the existing schemes.Secure biometric authentication aims to replace an encryption key or an identity certificate with biometrics to complete authentication. In the third paper, 'A Secure Biometric Authentication Based on PEKS' [3], Zhang et al. present a generic transformation from searchable encryption to secure biometric authentication and construct a specific secure biometric authentication scheme based on public key encryption with keyword search. Compared with some existing authentication schemes, the proposed scheme is more efficient in the practical application. Furthermore, the transformation from searchable encryption to secure biometric authentication presents a new direction of constructing authentication scheme.Certificateless aggregate signature schemes are required to satisfy the applications in certificateless environment. In the fourth paper, 'A New Certificatele...

show abstract

“…As a result, CLAS not only reduces the signature length and the verifier’s computation costs, but also enhances the security of aggregate signature. CLAS is a very useful technique for reducing communication bandwidth and storage overhead, and it is very suitable for environments with limited computing resources and high-efficiency requirements, such as vehicular ad-hoc networks [22–24], wireless sensor networks [25, 26], the Internet of things [27], and so on [28, 29].…”

Section: Introductionmentioning

confidence: 99%

“…Chen et al [35] presented another CLAS scheme, but was vulnerable to public key replacement attacks and honest-but-curious KGC attacks [36, 37]. Deng et al [38] constructed an efficient CLAS scheme and demonstrated its security, but Kumar and Sharma [39] showed that this scheme [38] could not provide unforgeability. Zhang et al [40] also proposed an efficient CLAS scheme and proved its security in the random oracle model.…”

Section: Introductionmentioning

confidence: 99%

A short certificateless aggregate signature against coalition attacks

Yang

Wang

et al. 2018

PLoS ONE

View full text Add to dashboard Cite

Certificateless aggregate signature (CLAS) is a crucial cryptosystem. It can not only compress multiple signatures into a short signature, but also ensure the validity of each signature participating in the aggregation by verifying the validity of an resulting aggregate signature. Therefore, a secure and efficient CLAS scheme is very useful for resource-constrained environments because it greatly reduces the overall length of the signature and the verifier’s computational overhead. Cheng et al. presented an efficient CLAS scheme and proved its security in the random oracle model. However, we find that their scheme has security flaws. In this paper, we demonstrate that Cheng et al.’s CLAS scheme is vulnerable to coalition attacks from internal signers. To overcome these attacks, we present an improved CLAS scheme and prove that it is existentially unforgeable under the computational Diffie-Hellman assumption. In addition, our CLAS scheme can not only resist coalition attacks but also generate a very short aggregate signature. The performance analysis results show that our improved CLAS scheme is lower than the related CLAS schemes in terms of communication overhead and computation cost.

show abstract

A new certificateless signature with enhanced security and aggregation version

Cited by 16 publications

References 22 publications

Certificateless Short Aggregate Signature Scheme for Mobile Devices

Certificateless Short Aggregate Signature Scheme for Mobile Devices

Recent advances in security and privacy in large‐scale networks

A short certificateless aggregate signature against coalition attacks

Contact Info

Product

Resources

About