Blockchain,known for its secure encrypted ledger,has garnered attention in financial and data transfer realms,including the field of energy trading.However,the decentralized nature and identity anonymity of user nodes...Blockchain,known for its secure encrypted ledger,has garnered attention in financial and data transfer realms,including the field of energy trading.However,the decentralized nature and identity anonymity of user nodes raise uncertainties in energy transactions.The broadcast consensus authentication slows transaction speeds,and frequent single-point transactions in multi-node settings pose key exposure risks without protective measures during user signing.To address these,an alliance blockchain scheme is proposed,reducing the resource-intensive identity verification among nodes.It integrates multi-signature functionality to fortify user resources and transac-tion security.A novel multi-signature process within this framework involves neutral nodes established through central nodes.These neutral nodes participate in multi-signature’s signing and verification,ensuring user identity and transaction content privacy.Reducing interactions among user nodes enhances transaction efficiency by minimizing communication overhead during verification and consensus stages.Rigorous assessments on reliability and operational speed highlight superior security performance,resilient against conventional attack vectors.Simulation shows that compared to traditional solutions,this scheme has advantages in terms of running speed.In conclusion,the alliance blockchain framework introduces a novel approach to tackle blockchain’s limitations in energy transactions.The integrated multi-signature process,involving neutral nodes,significantly enhances security and privacy.The scheme’s efficiency,validated through analytical assessments and simulations,indicates robustness against security threats and improved transactional speeds.This research underscores the potential for improved security and efficiency in blockchain-enabled energy trading systems.展开更多
Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has ...Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has one thing in common,that is,the generation and verification of signature depend heavily on the shared classical secret key.In order to increase the reliability of signature,the homomorphic aggregation technique is applied to quantum multi-signature,and then we propose a quantum homomorphic multi-signature protocol.Unlike previous quantum multi-signature protocols,this protocol utilizes homomorphic properties to complete signature generation and verification.In the signature generation phase,entanglement swapping is introduced,so that the individual signatures of multiple users are aggregated into a new multi-signature.The original quantum state is signed by the shared secret key to realize the verification of the signature in the verification phase.The signature process satisfies the homomorphic property,which can improve the reliability of the signature.展开更多
This paper proposes a threshold mult-proxy multi-signature scheme with share verification. In the scheme, a subset of original signers allows a designated group of proxy signers to sign on behalf of the original group...This paper proposes a threshold mult-proxy multi-signature scheme with share verification. In the scheme, a subset of original signers allows a designated group of proxy signers to sign on behalf of the original group. A message m has to be signed by a subset of proxy signers who can represent the proxy group. Then, the proxy signature is sent to the verifier group. A subset of verifiers in the verifier group can also represent the group to authenticate the proxy signature. In other words, some threshold values will be given to indicate the number of persons to represent a group to authorize the signing capability or to sign a message or to verify the proxy signature.展开更多
In 2005, Bao, et al. [Appl. Math. and Comput., vol.169, No.2, 2005] showed that Tzeng, et al.’s nonrepudiable threshold multi-proxy multi-signature scheme with shared verification was insecure, and proposed an improv...In 2005, Bao, et al. [Appl. Math. and Comput., vol.169, No.2, 2005] showed that Tzeng, et al.’s nonrepudiable threshold multi-proxy multi-signature scheme with shared verification was insecure, and proposed an improved scheme with no Share Distribution Center (SDC). This paper shows that Bao, et al.’s scheme suffers from the proxy relationship inversion attack and forgery attack, and pro- poses an improvement of Bao, et al.’s scheme.展开更多
Kang, et al. [Journal of Electronics(China), 23(2006)4] proposed a threshold multi-proxy multi-signature scheme, and claimed the scheme satisfies the security requirements of threshold multi-proxy multi-signature. How...Kang, et al. [Journal of Electronics(China), 23(2006)4] proposed a threshold multi-proxy multi-signature scheme, and claimed the scheme satisfies the security requirements of threshold multi-proxy multi-signature. However, in this paper, two forgery attacks are proposed to show that their schemes have serious security flaws. To overcome theses flaws, an improvement on Kang, et al.’s scheme is proposed.展开更多
Secret sharing and digital signature is an important research area in information security and has wide applications in such fields as safeguarding and legal use of confidential information, secure multiparty computat...Secret sharing and digital signature is an important research area in information security and has wide applications in such fields as safeguarding and legal use of confidential information, secure multiparty computation and electronic commerce. But up to now, study of signature based on general vector space secret sharing is very weak. Aiming at this drawback, the authors did some research on vector space secret sharing against cheaters, and proposed an efficient but secure vector space secret sharing based multi-signature scheme, which is implemented in two channels. In this scheme, the group signature can be easily produced if an authorized subset of participants pool their secret shadows and it is impossible for them to generate a group signature if an unauthorized subset of participants pool their secret shadows. The validity of the group signature can be verified by means of verification equations. A group signature of authorized subset of participants cannot be impersonated by any other set of partici- pants. Moreover, the suspected forgery can be traced, and the malicious participants can be detected in the scheme. None of several possible attacks can successfully break this scheme.展开更多
A new multi-signature scheme was proposed with the extension of the direct anonymous attestation （DAA） protocol supported by trusted computing （TC） technology. Analysis and simulation results show that the signer...A new multi-signature scheme was proposed with the extension of the direct anonymous attestation （DAA） protocol supported by trusted computing （TC） technology. Analysis and simulation results show that the signer＇s privacy is well protected with dynamic anonymity, the public key and signatures have length independent of the number of signature members, new signers are allowed to join the signature without modifying the public key, and attacks caused by secret key dumping or leaking can be avoided.展开更多
ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we...ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.展开更多
The paper proposes a new sequential digital multi-signature scheme based on Knapsack public-key cryptosystem,which is different from the existing scheme.The advantages of this scheme over the existing schemes are that...The paper proposes a new sequential digital multi-signature scheme based on Knapsack public-key cryptosystem,which is different from the existing scheme.The advantages of this scheme over the existing schemes are that it simplifies the signature generation process and speeds up the signature verification process.What’s more,the scheme reduces the cost of communication and redundancy operation, and improves efficiency,and can avoid cheating by signer efficiently,so the scheme has very broad application prospects.展开更多
In the last couple of years, D-based cryptography has got fruitful achievements. Proxy multi-signature allows a designated person, called a proxy signer, to sign on behalf of two or more original signers. In this pape...In the last couple of years, D-based cryptography has got fruitful achievements. Proxy multi-signature allows a designated person, called a proxy signer, to sign on behalf of two or more original signers. In this paper, we present a general security model for ID-based proxy multi-signature （ID-PMS） schemes. Then, we show how to construct a secure ID-PMS scheme from a secure ID-based signature scheme, and prove that the security of the construction can be reduced to the security of the original ID-based signature scheme.展开更多
To enhance the robustness of a proxy multi-signature scheme and improve its efficiency, a novel proxy signature paradigm is proposed referred to as In this paradigm, multiple proxy signer candidates identity-based pro...To enhance the robustness of a proxy multi-signature scheme and improve its efficiency, a novel proxy signature paradigm is proposed referred to as In this paradigm, multiple proxy signer candidates identity-based proxy multi-signature （IBPMS）. are employed to play a role of the single proxy signer in the existing model. A provably secure IBPMS scheme is presented which requires only one round broadcast operation. Performance analysis demonstrates that the new scheme outperforms the existing multi-signature schemes in robustness and communication. These properties are rendered to our IBPMS scheme as a more practical solution to secure e-transaction delegation applications of proxy signatures.展开更多
We present a multi-signature scheme based on DSA and describes a faireleetronic payment scheme based on improved DSA signatures. The scheme, makes both sides in e-qualpositions during the course of electronic transact...We present a multi-signature scheme based on DSA and describes a faireleetronic payment scheme based on improved DSA signatures. The scheme, makes both sides in e-qualpositions during the course of electronic transaction A Trusted Third Party (TTP)is involved in thescheme to guarantee the fairness of the scheme for both sides. However, only during the course ofregistration and dispute resolution will TTP be needed TTP is not needed during the normal paymentstage.展开更多
The concept of proxy signature introduced by Mambo, Usuda, and Okamoto allows a designated person, called a proxy signer, to sign on behalf of an original signer in 1996. However, most existing proxy signature schemes...The concept of proxy signature introduced by Mambo, Usuda, and Okamoto allows a designated person, called a proxy signer, to sign on behalf of an original signer in 1996. However, most existing proxy signature schemes does not support nonrepudiation. In this paper, we propose two secure nonrepudiable proxy signature schemes, which overcome disadvantages of M U O and K P W proxy signature schemes, respectively. The schemes proposed can withstand public key substitution attack and forge attack. In addition, our new schemes have some other advantages such as proxy signature key generation and updating using insecure channels. Our approach can also be applied to other ElGamal like proxy signature schemes.展开更多
Digital signature has recently played an increasingly important role in cyberspace security.Most of them are based on the public key cryptography.Public key cryptography is a mainstream cryptographic algorithm system ...Digital signature has recently played an increasingly important role in cyberspace security.Most of them are based on the public key cryptography.Public key cryptography is a mainstream cryptographic algorithm system that has been widely used in cyberspace security in recent years.The most classic public key cryptography algorithm is RSA and its difficulty is based on the large integer decomposition problem.In 2017,ISRSAC was proposed by M.Thangaval.ISRSAC has made security improvements to the RSA algorithm by increasing the complexity in factoring the value of modulus‘n’.A digital signature algorithm based on ISRSAC algorithm was completed in this paper,and furthermore,a proxy signature algorithm based on ISRSAC and two kinds of multi-signature algorithms were presented,which include sequential multi-signature and broadcasting multi-signature.展开更多
The traditional centralized data sharing systems have potential risks such as single point of failures and excessive working load on the central node.As a distributed and collaborative alternative,approaches based upo...The traditional centralized data sharing systems have potential risks such as single point of failures and excessive working load on the central node.As a distributed and collaborative alternative,approaches based upon blockchain have been explored recently for Internet of Things(IoTs).However,the access from a legitimate user may be denied without the pre-defined policy and data update on the blockchain could be costly to the owners.In this paper,we first address these issues by incorporating the Accountable Subgroup Multi-Signature(ASM)algorithm into the Attribute-based Access Control(ABAC)method with Policy Smart Contract,to provide a finegrained and flexible solution.Next,we propose a policy-based Chameleon Hash algorithm that allows the data to be updated in a reliable and convenient way by the authorized users.Finally,we evaluate our work by comparing its performance with the benchmarks.The results demonstrate significant improvement on the effectiveness and efficiency.展开更多
The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several mu...The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several multisignature schemes have been proposed since. Chen et al. proposed a new digital multi-signature scheme based on the elliptic curve cryptosystem recently. In this paper, we show that their scheme is insecure, for it is vulnerable to the so-called active attacks, such as the substitution of a ＂false＂ public key to a ＂true＂ one in a key directory or during transmission. And then the attacker can sign a legal signature which other users have signed and forge a signature himself which can be accepted by the verifier.展开更多
Based on the Kim-like's proxy multi-signature scheme, an improved proxymulti-signature scheme is proposed. The new scheme overcomes the two problems in the Kim-like'sproxy multi-signature scheme: (1) Security ...Based on the Kim-like's proxy multi-signature scheme, an improved proxymulti-signature scheme is proposed. The new scheme overcomes the two problems in the Kim-like'sproxy multi-signature scheme: (1) Security issue ( every original signer can forge a valid proxymulti-signature for any message); (2) Efficiency issue ( both the size of the proxy multi-signatureand the efficiency of signature checking are dependent on the number of the original signers).展开更多
Proxy signature schemes enable an entity to del- egate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxy multi- signature allows a group of original signers t...Proxy signature schemes enable an entity to del- egate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxy multi- signature allows a group of original signers to delegate their signing capabilities to a single proxy signer in such a way that the proxy signer can sign a message on behalf of the group of original signers. We propose a concrete ID-based proxy multi-signature scheme from bilinear pairings. The proposed scheme is existential unforgeable against adaptively chosen message and given ID-attack in random oracle model under the computational Diltie-Hellman （CDH） assumption. The fascinating property of new scheme is that the size of a proxy multi-signature is independent of the number of original sign- ers. Furthermore the proposed scheme is simple and com- putationally more efficient than other ID-based proxy multi- signature schemes.展开更多
Network coding can save wireless network resources and is very fast in comparison with traditional routing.In real application scenarios,network coding is vulnerable to pollution attacks and forgery attacks.To solve t...Network coding can save wireless network resources and is very fast in comparison with traditional routing.In real application scenarios,network coding is vulnerable to pollution attacks and forgery attacks.To solve these problems,the certificateless broadcast multi-signature for network coding(NC-CLBMS)method is devised,where each source node user generates a multisignature about the message vector,and the intermediate node linearly combines the received data.NC-CLBMS is a multi-source multi-signature method with anti-pollution and anti-forgery advantages;moreover,it has a fixed signature length and its computation efficiency is very high.NC-CLBMS has extensive application prospects in unmanned aerial vehicle(UAV)communication networks,fifth-generation wireless networks,wireless sensor networks,mobile wireless networks,and Internet of Vehicles.展开更多
The traditional digital multi-signature schemes are mostly based on large integer factorization and the discrete logarithm,which cannot be secured in quantum environment.The paper presents a lattice-based multi-signat...The traditional digital multi-signature schemes are mostly based on large integer factorization and the discrete logarithm,which cannot be secured in quantum environment.The paper presents a lattice-based multi-signature scheme that can resist the quantum attack using the hardness of average-case short integer solution problem(SIS).Multi-signature includes the simultaneous signature and sequential signature.The paper describes respectively the key generation,multi-signature generation and multi-signature verification of the two types of schemes.Moreover,experimental results prove that the digital multi-signature scheme based on lattice is especially efficient and secure to multi-signature generation.展开更多
文摘Blockchain,known for its secure encrypted ledger,has garnered attention in financial and data transfer realms,including the field of energy trading.However,the decentralized nature and identity anonymity of user nodes raise uncertainties in energy transactions.The broadcast consensus authentication slows transaction speeds,and frequent single-point transactions in multi-node settings pose key exposure risks without protective measures during user signing.To address these,an alliance blockchain scheme is proposed,reducing the resource-intensive identity verification among nodes.It integrates multi-signature functionality to fortify user resources and transac-tion security.A novel multi-signature process within this framework involves neutral nodes established through central nodes.These neutral nodes participate in multi-signature’s signing and verification,ensuring user identity and transaction content privacy.Reducing interactions among user nodes enhances transaction efficiency by minimizing communication overhead during verification and consensus stages.Rigorous assessments on reliability and operational speed highlight superior security performance,resilient against conventional attack vectors.Simulation shows that compared to traditional solutions,this scheme has advantages in terms of running speed.In conclusion,the alliance blockchain framework introduces a novel approach to tackle blockchain’s limitations in energy transactions.The integrated multi-signature process,involving neutral nodes,significantly enhances security and privacy.The scheme’s efficiency,validated through analytical assessments and simulations,indicates robustness against security threats and improved transactional speeds.This research underscores the potential for improved security and efficiency in blockchain-enabled energy trading systems.
基金Project supported by the National Natural Science Foundation of China(Grant No.61762039).
文摘Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has one thing in common,that is,the generation and verification of signature depend heavily on the shared classical secret key.In order to increase the reliability of signature,the homomorphic aggregation technique is applied to quantum multi-signature,and then we propose a quantum homomorphic multi-signature protocol.Unlike previous quantum multi-signature protocols,this protocol utilizes homomorphic properties to complete signature generation and verification.In the signature generation phase,entanglement swapping is introduced,so that the individual signatures of multiple users are aggregated into a new multi-signature.The original quantum state is signed by the shared secret key to realize the verification of the signature in the verification phase.The signature process satisfies the homomorphic property,which can improve the reliability of the signature.
基金Supported by the National Natural Science Foundation of China (No.10471152).
文摘This paper proposes a threshold mult-proxy multi-signature scheme with share verification. In the scheme, a subset of original signers allows a designated group of proxy signers to sign on behalf of the original group. A message m has to be signed by a subset of proxy signers who can represent the proxy group. Then, the proxy signature is sent to the verifier group. A subset of verifiers in the verifier group can also represent the group to authenticate the proxy signature. In other words, some threshold values will be given to indicate the number of persons to represent a group to authorize the signing capability or to sign a message or to verify the proxy signature.
基金Supported by the National Natural Science Foundation of China (No.10671051)the Natural Science Foundation of Zhejiang Province (No.Y105067).
文摘In 2005, Bao, et al. [Appl. Math. and Comput., vol.169, No.2, 2005] showed that Tzeng, et al.’s nonrepudiable threshold multi-proxy multi-signature scheme with shared verification was insecure, and proposed an improved scheme with no Share Distribution Center (SDC). This paper shows that Bao, et al.’s scheme suffers from the proxy relationship inversion attack and forgery attack, and pro- poses an improvement of Bao, et al.’s scheme.
基金Supported by the National Natural Science Foundation of China (No.60503005)the Natural Science Foundation of Hunan Province (No.07JJ6110)
文摘Kang, et al. [Journal of Electronics(China), 23(2006)4] proposed a threshold multi-proxy multi-signature scheme, and claimed the scheme satisfies the security requirements of threshold multi-proxy multi-signature. However, in this paper, two forgery attacks are proposed to show that their schemes have serious security flaws. To overcome theses flaws, an improvement on Kang, et al.’s scheme is proposed.
文摘Secret sharing and digital signature is an important research area in information security and has wide applications in such fields as safeguarding and legal use of confidential information, secure multiparty computation and electronic commerce. But up to now, study of signature based on general vector space secret sharing is very weak. Aiming at this drawback, the authors did some research on vector space secret sharing against cheaters, and proposed an efficient but secure vector space secret sharing based multi-signature scheme, which is implemented in two channels. In this scheme, the group signature can be easily produced if an authorized subset of participants pool their secret shadows and it is impossible for them to generate a group signature if an unauthorized subset of participants pool their secret shadows. The validity of the group signature can be verified by means of verification equations. A group signature of authorized subset of participants cannot be impersonated by any other set of partici- pants. Moreover, the suspected forgery can be traced, and the malicious participants can be detected in the scheme. None of several possible attacks can successfully break this scheme.
基金the National High Technology Research and Development Program of China(863 Program) (2005AA145110, 2006AA01Z436)the Natural Science Foundation of Shanghai (05ZR14083)the Pudong New Area Technology Innovation Public Service Platform of China (PDPT2005-04)
文摘A new multi-signature scheme was proposed with the extension of the direct anonymous attestation （DAA） protocol supported by trusted computing （TC） technology. Analysis and simulation results show that the signer＇s privacy is well protected with dynamic anonymity, the public key and signatures have length independent of the number of signature members, new signers are allowed to join the signature without modifying the public key, and attacks caused by secret key dumping or leaking can be avoided.
基金Supported bythe National Key Basic Research andDevelopment Program (973 Program G1999035804),the NationalNatural Science Foundation of China (90204015 ,60473021) and theElitist Youth Foundation of Henan Province (021201400)
文摘ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.
基金supported by the National Key Lab.of Integrated Service Networks of Xidian University(No.ISN7-01)National Natural Science Foundation of China(No.60642008)
文摘The paper proposes a new sequential digital multi-signature scheme based on Knapsack public-key cryptosystem,which is different from the existing scheme.The advantages of this scheme over the existing schemes are that it simplifies the signature generation process and speeds up the signature verification process.What’s more,the scheme reduces the cost of communication and redundancy operation, and improves efficiency,and can avoid cheating by signer efficiently,so the scheme has very broad application prospects.
基金Supported by the National Natural Science Foundation of China (60473021) and the Science Foundation of Henan Province (0511010900)
文摘In the last couple of years, D-based cryptography has got fruitful achievements. Proxy multi-signature allows a designated person, called a proxy signer, to sign on behalf of two or more original signers. In this paper, we present a general security model for ID-based proxy multi-signature （ID-PMS） schemes. Then, we show how to construct a secure ID-PMS scheme from a secure ID-based signature scheme, and prove that the security of the construction can be reduced to the security of the original ID-based signature scheme.
基金Supported by the National Basic Research Program of China(No.2012CB315905)the National Natural Science Foundation of China(No.61272501)the Fund of Tianjin Key Laboratory of Civil Aircraft Airworthiness and Maintenance in CAUC and a General grant from Civil Aviation Flight University of China(No.J2013-31,Q2014-48)
文摘To enhance the robustness of a proxy multi-signature scheme and improve its efficiency, a novel proxy signature paradigm is proposed referred to as In this paradigm, multiple proxy signer candidates identity-based proxy multi-signature （IBPMS）. are employed to play a role of the single proxy signer in the existing model. A provably secure IBPMS scheme is presented which requires only one round broadcast operation. Performance analysis demonstrates that the new scheme outperforms the existing multi-signature schemes in robustness and communication. These properties are rendered to our IBPMS scheme as a more practical solution to secure e-transaction delegation applications of proxy signatures.
文摘We present a multi-signature scheme based on DSA and describes a faireleetronic payment scheme based on improved DSA signatures. The scheme, makes both sides in e-qualpositions during the course of electronic transaction A Trusted Third Party (TTP)is involved in thescheme to guarantee the fairness of the scheme for both sides. However, only during the course ofregistration and dispute resolution will TTP be needed TTP is not needed during the normal paymentstage.
文摘The concept of proxy signature introduced by Mambo, Usuda, and Okamoto allows a designated person, called a proxy signer, to sign on behalf of an original signer in 1996. However, most existing proxy signature schemes does not support nonrepudiation. In this paper, we propose two secure nonrepudiable proxy signature schemes, which overcome disadvantages of M U O and K P W proxy signature schemes, respectively. The schemes proposed can withstand public key substitution attack and forge attack. In addition, our new schemes have some other advantages such as proxy signature key generation and updating using insecure channels. Our approach can also be applied to other ElGamal like proxy signature schemes.
基金This work has been performed in National Natural Science Foundation of China(No.61772047,61372069)the Fundamental Research Funds for the Central Universities(No.328201902)+2 种基金National Defense Pre-research Foundation,SRF for ROCS,SEM(JY0600090102)111 project(No.B08038)China Civil Aviation Information Technology Research Base Funded Project(CAAC-ITRB-201705).
文摘Digital signature has recently played an increasingly important role in cyberspace security.Most of them are based on the public key cryptography.Public key cryptography is a mainstream cryptographic algorithm system that has been widely used in cyberspace security in recent years.The most classic public key cryptography algorithm is RSA and its difficulty is based on the large integer decomposition problem.In 2017,ISRSAC was proposed by M.Thangaval.ISRSAC has made security improvements to the RSA algorithm by increasing the complexity in factoring the value of modulus‘n’.A digital signature algorithm based on ISRSAC algorithm was completed in this paper,and furthermore,a proxy signature algorithm based on ISRSAC and two kinds of multi-signature algorithms were presented,which include sequential multi-signature and broadcasting multi-signature.
基金supported by the National Natural Science Foundation of China under Grant 61972148。
文摘The traditional centralized data sharing systems have potential risks such as single point of failures and excessive working load on the central node.As a distributed and collaborative alternative,approaches based upon blockchain have been explored recently for Internet of Things(IoTs).However,the access from a legitimate user may be denied without the pre-defined policy and data update on the blockchain could be costly to the owners.In this paper,we first address these issues by incorporating the Accountable Subgroup Multi-Signature(ASM)algorithm into the Attribute-based Access Control(ABAC)method with Policy Smart Contract,to provide a finegrained and flexible solution.Next,we propose a policy-based Chameleon Hash algorithm that allows the data to be updated in a reliable and convenient way by the authorized users.Finally,we evaluate our work by comparing its performance with the benchmarks.The results demonstrate significant improvement on the effectiveness and efficiency.
基金This work is supported by the National Natural Science Foundation of China under Grant No. 90304014 and the National Grand Fundamental Research 973 Program of China under Grant No. 2003CB314805.
文摘The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several multisignature schemes have been proposed since. Chen et al. proposed a new digital multi-signature scheme based on the elliptic curve cryptosystem recently. In this paper, we show that their scheme is insecure, for it is vulnerable to the so-called active attacks, such as the substitution of a ＂false＂ public key to a ＂true＂ one in a key directory or during transmission. And then the attacker can sign a legal signature which other users have signed and forge a signature himself which can be accepted by the verifier.
基金This work is supported by the Natural Science Foundation of China (No.60372094No.90204017) and"973"project of China (No.G1999035804).
文摘Based on the Kim-like's proxy multi-signature scheme, an improved proxymulti-signature scheme is proposed. The new scheme overcomes the two problems in the Kim-like'sproxy multi-signature scheme: (1) Security issue ( every original signer can forge a valid proxymulti-signature for any message); (2) Efficiency issue ( both the size of the proxy multi-signatureand the efficiency of signature checking are dependent on the number of the original signers).
文摘Proxy signature schemes enable an entity to del- egate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxy multi- signature allows a group of original signers to delegate their signing capabilities to a single proxy signer in such a way that the proxy signer can sign a message on behalf of the group of original signers. We propose a concrete ID-based proxy multi-signature scheme from bilinear pairings. The proposed scheme is existential unforgeable against adaptively chosen message and given ID-attack in random oracle model under the computational Diltie-Hellman （CDH） assumption. The fascinating property of new scheme is that the size of a proxy multi-signature is independent of the number of original sign- ers. Furthermore the proposed scheme is simple and com- putationally more efficient than other ID-based proxy multi- signature schemes.
基金Project supported by the Key Project of Natural Science Basis Research Plan of Shaanxi Province,China(No.2020JZ-54)。
文摘Network coding can save wireless network resources and is very fast in comparison with traditional routing.In real application scenarios,network coding is vulnerable to pollution attacks and forgery attacks.To solve these problems,the certificateless broadcast multi-signature for network coding(NC-CLBMS)method is devised,where each source node user generates a multisignature about the message vector,and the intermediate node linearly combines the received data.NC-CLBMS is a multi-source multi-signature method with anti-pollution and anti-forgery advantages;moreover,it has a fixed signature length and its computation efficiency is very high.NC-CLBMS has extensive application prospects in unmanned aerial vehicle(UAV)communication networks,fifth-generation wireless networks,wireless sensor networks,mobile wireless networks,and Internet of Vehicles.
基金Qinghai Office of ScienceTechnology(No.2019-ZJ-7086,No.2018-SF-143),the National Social Science Foundation of China(No.18XMZ050)the Key Laboratory of IoT of Qinghai(No.2020-ZJ-Y16).
文摘The traditional digital multi-signature schemes are mostly based on large integer factorization and the discrete logarithm,which cannot be secured in quantum environment.The paper presents a lattice-based multi-signature scheme that can resist the quantum attack using the hardness of average-case short integer solution problem(SIS).Multi-signature includes the simultaneous signature and sequential signature.The paper describes respectively the key generation,multi-signature generation and multi-signature verification of the two types of schemes.Moreover,experimental results prove that the digital multi-signature scheme based on lattice is especially efficient and secure to multi-signature generation.
