As mobile internet and Internet of Things technologies continue to advance,the application scenarios of peer-to-peer Internet of Drones(IoD)are becoming increasingly diverse.However,the development of IoD also faces s...As mobile internet and Internet of Things technologies continue to advance,the application scenarios of peer-to-peer Internet of Drones(IoD)are becoming increasingly diverse.However,the development of IoD also faces signifcant challenges,such as security,privacy protection,and limited computing power,which require technological innova-tion to overcome.For group secure communication,it is necessary to provide two basic services,user authentication and group key agreement.Due to the limited storage of IoD devices,group key negotiation requires lightweight calculations,and conventional schemes cannot satisfy the requirements of group communication in the IoD.To this end,a new lightweight communication scheme based on ring neighbors is presented in this paper for IoD,which not only realizes the identity verifcation of user and group key negotiation,but also improves computational ef-ciency on each group member side.A detailed security analysis substantiates that the designed scheme is capable of withstanding attacks from both internal and external adversaries while satisfying all defned security requirements.More importantly,in our proposal,the computational cost on the user side remains unafected by the variability of the number of members participating in group communication,as members communicate in a non-interactive manner through broadcasting.As a result,the protocol proposed in this article demonstrates lower computational and communication costs in comparison to other cryptographic schemes.Hence,this proposal presents a more appealing approach to lightweight group key agreement protocol with user authentication for application in the IoD.展开更多
A(t,n)threshold secret sharing scheme is a fundamental tool in many security applications such as cloud computing and multiparty computing.In conventional threshold secret sharing schemes,like Shamir’s scheme based o...A(t,n)threshold secret sharing scheme is a fundamental tool in many security applications such as cloud computing and multiparty computing.In conventional threshold secret sharing schemes,like Shamir’s scheme based on a univariate polynomial,additional communication key share scheme is needed for shareholders to protect the secrecy of their shares if secret reconstruction is performed over a network.In the secret reconstruction,the threshold changeable secret sharing(TCSS)allows the threshold to be a dynamic value so that if some shares have been compromised in a given time,it needs more shares to reconstruct the secret.Recently,a new secret sharing scheme based on a bivariate polynomial is proposed in which shares generated initially by a dealer can be used not only to reconstruct the secret but also to protect the secrecy of shares when the secret reconstruction is performed over a network.In this paper,we further extend this scheme to enable it to be a TCSS without any modification.Our proposed TCSS is dealer-free and non-interactive.Shares generated by a dealer in our scheme can serve for three purposes,(a)to reconstruct a secret;(b)to protect the secrecy of shares if secret reconstruction is performed over a network;and(c)to enable the threshold changeable property.展开更多
基金supported by the National Natural Science Founda-tion of China(Grants Nos.62172181,62272189,62072133)the Fundamental Research Funds for the Central Universities(No.CCNU19TS019)+1 种基金the Research Planning Project of National Language Committee(No.YB135-40)the Research Initiation Project of Zhejiang Lab(No.2022PD0AC02).
文摘As mobile internet and Internet of Things technologies continue to advance,the application scenarios of peer-to-peer Internet of Drones(IoD)are becoming increasingly diverse.However,the development of IoD also faces signifcant challenges,such as security,privacy protection,and limited computing power,which require technological innova-tion to overcome.For group secure communication,it is necessary to provide two basic services,user authentication and group key agreement.Due to the limited storage of IoD devices,group key negotiation requires lightweight calculations,and conventional schemes cannot satisfy the requirements of group communication in the IoD.To this end,a new lightweight communication scheme based on ring neighbors is presented in this paper for IoD,which not only realizes the identity verifcation of user and group key negotiation,but also improves computational ef-ciency on each group member side.A detailed security analysis substantiates that the designed scheme is capable of withstanding attacks from both internal and external adversaries while satisfying all defned security requirements.More importantly,in our proposal,the computational cost on the user side remains unafected by the variability of the number of members participating in group communication,as members communicate in a non-interactive manner through broadcasting.As a result,the protocol proposed in this article demonstrates lower computational and communication costs in comparison to other cryptographic schemes.Hence,this proposal presents a more appealing approach to lightweight group key agreement protocol with user authentication for application in the IoD.
基金This work was partially supported by the National Natural Science Foundation of China(Grants Nos.61772224,62072133)the Fundamental Research Funds for the Central Universities(CCNU19TS019)+1 种基金the Research Planning Project of National Language Committee(YB135-40)the key projects of Guangxi Natural Science Foundation(2018GXNSFDA281040).Lein Harn,Chingfang Hsu and Zhe Xia contributed equally to this work.
文摘A(t,n)threshold secret sharing scheme is a fundamental tool in many security applications such as cloud computing and multiparty computing.In conventional threshold secret sharing schemes,like Shamir’s scheme based on a univariate polynomial,additional communication key share scheme is needed for shareholders to protect the secrecy of their shares if secret reconstruction is performed over a network.In the secret reconstruction,the threshold changeable secret sharing(TCSS)allows the threshold to be a dynamic value so that if some shares have been compromised in a given time,it needs more shares to reconstruct the secret.Recently,a new secret sharing scheme based on a bivariate polynomial is proposed in which shares generated initially by a dealer can be used not only to reconstruct the secret but also to protect the secrecy of shares when the secret reconstruction is performed over a network.In this paper,we further extend this scheme to enable it to be a TCSS without any modification.Our proposed TCSS is dealer-free and non-interactive.Shares generated by a dealer in our scheme can serve for three purposes,(a)to reconstruct a secret;(b)to protect the secrecy of shares if secret reconstruction is performed over a network;and(c)to enable the threshold changeable property.
