In ubiquitous computing, data should be able to be accessed from any location, and the correctness of data becomes vital during the communication. Suppose that many users sign different messages respectively, before f...In ubiquitous computing, data should be able to be accessed from any location, and the correctness of data becomes vital during the communication. Suppose that many users sign different messages respectively, before forwarding or sending these messages, then the verifier must spend a lot of computing time to verify their signatures. Consequently, the aggregate signature scheme is an effective method of improving efficiency in this kind of systems, which provides the convenience for the verifier. In this paper, we propose a new certificateless aggregate signature scheme which is efficient in generating a signature and verification. This scheme is provably secure under the extended computational Diffie-Hellman assumption.展开更多
The Vehicular Ad-hoc Network(VANET)is the fundamental of smart transportation system in the future,but the security of the communication between vehicles and vehicles,between vehicles and roadside infrastructures have...The Vehicular Ad-hoc Network(VANET)is the fundamental of smart transportation system in the future,but the security of the communication between vehicles and vehicles,between vehicles and roadside infrastructures have become increasingly prominent.Certificateless aggregate signature protocol is used to address this security issue,but the existing schemes still have many drawbacks in terms of security and efficiency:First,many schemes are not secure,and signatures can be forged by the attacker;Second,even if some scheme are secure,many schemes use a large number of bilinear pairing operation,and the computation overhead is large.At the same time,the length of the aggregated signature also increases linearly with the increase of user numbers,resulting in a large communication overhead.In order to overcome the above challenges,we propose a new certificateless aggregate signature scheme for VANET,and prove the security of the scheme under the random oracle model.The new scheme uses pseudonym to realize the conditional privacy protection of the vehicle’s information.The new scheme does not use bilinear pairing operation,and the calculation efficiency is high.At the same time,the length of the aggregate signature of the new scheme is constant,thereby greatly reducing the communication and storage overhead.The analysis results demonstrate that the new scheme is not only safer,but also superior in performance to the recent related schemes in computation overhead and communication cost.展开更多
Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificate...Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificateless public key cryptography and aggregate signatures, we propose an efficient certificateless aggregate signature scheme and prove its security. The new scheme is proved secure against the two representative types adversaries in certificateless aggregate signature under the assumption that computational Diffie-Hellman problem is hard. Furthermore, from the comparison of the computation cost of the new scheme with some existing certificateless aggregate signature schemes in group sum computation, scalar multiplication computation, Hash computation and abilinear pairings computation, it concludes that the new scheme reduces the computation cost in scalar multiplication computation in half and maintains the same in the other computation costs.展开更多
A Certificateless Aggregate Signature(CLAS) scheme was proposed by Qu and Mu recently, which was published in "Int J. Electronic Security and Digital Forensics, 2018, 10(2)". They used discrete logarithm to ...A Certificateless Aggregate Signature(CLAS) scheme was proposed by Qu and Mu recently, which was published in "Int J. Electronic Security and Digital Forensics, 2018, 10(2)". They used discrete logarithm to ensure the scheme's security. However,we show by formulating an attack that their CLAS scheme cannot defend against Type I adversary. Furthermore, we point out an error that exists in the signature simulation of their security proof.After that we give a correct signature simulation for the security proof. Finally, to resist the Type I attack, we present two methods for improving Qu et al's CLAS scheme. Moreover, the second improving method can elevate the trust level of Qu et al's CLAS scheme to the highest trust level: Level 3.展开更多
基金supported by the National Science Council under Grant No. NSC100-2221-E-005-062 and NSC 100-2221-E-468-014
文摘In ubiquitous computing, data should be able to be accessed from any location, and the correctness of data becomes vital during the communication. Suppose that many users sign different messages respectively, before forwarding or sending these messages, then the verifier must spend a lot of computing time to verify their signatures. Consequently, the aggregate signature scheme is an effective method of improving efficiency in this kind of systems, which provides the convenience for the verifier. In this paper, we propose a new certificateless aggregate signature scheme which is efficient in generating a signature and verification. This scheme is provably secure under the extended computational Diffie-Hellman assumption.
基金This work was supported by the National Science Foundation of China(No.61872448)the Natural Science Basic Research Plan in Shanxi Province of China(No.2018JM6017).
文摘The Vehicular Ad-hoc Network(VANET)is the fundamental of smart transportation system in the future,but the security of the communication between vehicles and vehicles,between vehicles and roadside infrastructures have become increasingly prominent.Certificateless aggregate signature protocol is used to address this security issue,but the existing schemes still have many drawbacks in terms of security and efficiency:First,many schemes are not secure,and signatures can be forged by the attacker;Second,even if some scheme are secure,many schemes use a large number of bilinear pairing operation,and the computation overhead is large.At the same time,the length of the aggregated signature also increases linearly with the increase of user numbers,resulting in a large communication overhead.In order to overcome the above challenges,we propose a new certificateless aggregate signature scheme for VANET,and prove the security of the scheme under the random oracle model.The new scheme uses pseudonym to realize the conditional privacy protection of the vehicle’s information.The new scheme does not use bilinear pairing operation,and the calculation efficiency is high.At the same time,the length of the aggregate signature of the new scheme is constant,thereby greatly reducing the communication and storage overhead.The analysis results demonstrate that the new scheme is not only safer,but also superior in performance to the recent related schemes in computation overhead and communication cost.
基金Supported by the Applied Basic and Advanced Technology Research Programs of Tianjin(15JCYBJC15900)
文摘Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificateless public key cryptography and aggregate signatures, we propose an efficient certificateless aggregate signature scheme and prove its security. The new scheme is proved secure against the two representative types adversaries in certificateless aggregate signature under the assumption that computational Diffie-Hellman problem is hard. Furthermore, from the comparison of the computation cost of the new scheme with some existing certificateless aggregate signature schemes in group sum computation, scalar multiplication computation, Hash computation and abilinear pairings computation, it concludes that the new scheme reduces the computation cost in scalar multiplication computation in half and maintains the same in the other computation costs.
基金Supported by the National Natural Science Foundation of China(61373140,61170246)the Program for Innovative Research Team in Science and Technology in Fujian Province University and 2018 Scientific Research and Innovation Special Project of Putian University(2018ZP11,2018ZP12)+1 种基金the Opening Project of Key Laboratory of Financial Mathematics of Fujian Province University(Putian University)(JR201806)Educational Research Projects of Young and Middle-aged Teachers in Fujian Education Department(JT180487)。
文摘A Certificateless Aggregate Signature(CLAS) scheme was proposed by Qu and Mu recently, which was published in "Int J. Electronic Security and Digital Forensics, 2018, 10(2)". They used discrete logarithm to ensure the scheme's security. However,we show by formulating an attack that their CLAS scheme cannot defend against Type I adversary. Furthermore, we point out an error that exists in the signature simulation of their security proof.After that we give a correct signature simulation for the security proof. Finally, to resist the Type I attack, we present two methods for improving Qu et al's CLAS scheme. Moreover, the second improving method can elevate the trust level of Qu et al's CLAS scheme to the highest trust level: Level 3.
