A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key...A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one key, that is, a multi-secret sharing scheme has p （〉_ 2） keys. Dealer distribute shares of keys among n participants. Gathering t （〈 n） participants, keys can be reconstructed. Yang et al. （2004） gave a scheme of a （t, n） multi-secret sharing based on Lagrange＇s interpolation. Zhao et al. （2007） gave a scheme of a （t, n） verifiable multi-secret sharing based on Lagrange＇s interpolation. Recently, Adachi and Okazaki give a scheme of a （t, n） multi-secret sharing based on Hermite interpolation, in the case ofp 〈 t. In this paper, we give a scheme ofa （t, n） verifiable multi-secret sharing based on Hermite interpolation.展开更多
A multiple secret sharing scheme can share a group of secrets in each sharing session, which is very useful especially in sharing large secrets. However, most of the existing multiple secret sharing schemes are （t, n...A multiple secret sharing scheme can share a group of secrets in each sharing session, which is very useful especially in sharing large secrets. However, most of the existing multiple secret sharing schemes are （t, n） threshold schemes, so they are fit for only threshold applications and unfit for the applications of general access structures. Due to the fact that a （t, n） threshold scheme could only handle a small fraction of the secret sharing idea, a novel multi-secret sharing scheme is proposed, which is designed based on general access structures. The security of this scheme is the same as that of Shamir＇s threshold secret sharing scheme. Compared with the existing multiple secret sharing schemes, the proposed scheme can provide greater capabilities for many applications because it is able to deal with applications of general access structures.展开更多
To address the problem that existing bipartite secret sharing scheme is short of dynamic characteristic, and to solve the problem that each participant can only use secret share once, this paper proposed a bipartite (...To address the problem that existing bipartite secret sharing scheme is short of dynamic characteristic, and to solve the problem that each participant can only use secret share once, this paper proposed a bipartite (n1+n2, m1+m2)-threshold multi-secret sharing scheme which combined cryptography and hypersphere geometry. In this scheme, we introduced a bivariate function and a coordinate function over finite field Zp to calculate the derived points of secret share, which can reconstruct the shared secrets by producing the intersection point of hypernormal plane and normal line on the hypertangent plane. At the initial stage the secret dealer distributes to each participant a secret share that can be kept secret based on the intractability of discrete logarithm problem and need not be changed with updating the shared secrets.Each cooperative participant only needs to submit a derived point calculated from the secret share without exposing this secret share during the process of reconstructing the shared secret. Analyses indicate that the proposed scheme is not only sound and secure because of hypersphere geometric properties and the difficulty of discrete logarithm problem, but also efficient because of its well dynamic behavior and the invariant secret share. Therefore, this bipartite threshold multi-secret sharing scheme is easy to implement and is applicable in practical settings.展开更多
Based on Shamir's secret sharing, a (t, n) multi-secret sharing scheme isproposed in this paper p secrets can be shared among n participants, and t or more participants canco-operate to reconstruct these secrets a...Based on Shamir's secret sharing, a (t, n) multi-secret sharing scheme isproposed in this paper p secrets can be shared among n participants, and t or more participants canco-operate to reconstruct these secrets at the same time, but t— 1 or fewerparticipants can derivenothing about these secrets. Each participant's secret shadow is as short as each secret. Comparedwith the existing schemes, the proposed scheme is characterized by the lower complexity of thesecret reconstruction and less public information. The security of this scheme is the same as thatof Shamir' a threshold scheme. Analyses show that this scheme is an efficient, computationallysecure scheme.展开更多
Visual secret sharing(VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing(VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in ...Visual secret sharing(VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing(VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.展开更多
A secret sharing scheme is one of cryptographies. A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange's inter...A secret sharing scheme is one of cryptographies. A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange's interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one keys;that is, a multi-secret sharing scheme has p (≥2) keys. Dealers distribute shares of keys among n participants. Gathering t (≤n) participants, keys can be reconstructed. In this paper, we give a scheme of a (t,n) multi-secret sharing based on Hermite interpolation, in the case of p≤t.展开更多
Cryptography is deemed to be the optimum strategy to secure the data privacy in which the data is encoded ahead of time before sharing it.Visual Secret Sharing(VSS)is an encryption method in which the secret message i...Cryptography is deemed to be the optimum strategy to secure the data privacy in which the data is encoded ahead of time before sharing it.Visual Secret Sharing(VSS)is an encryption method in which the secret message is split into at least two trivial images called’shares’to cover it.However,such message are always targeted by hackers or dishonest members who attempt to decrypt the message.This can be avoided by not uncovering the secret message without the universal share when it is presented and is typically taken care of,by the trusted party.Hence,in this paper,an optimal and secure double-layered secret image sharing scheme is proposed.The proposed share creation process contains two layers such as threshold-based secret sharing in the first layer and universal share based secret sharing in the second layer.In first layer,Genetic Algorithm(GA)is applied to find the optimal threshold value based on the randomness of the created shares.Then,in the second layer,a novel design of universal share-based secret share creation method is proposed.Finally,Opposition Whale Optimization Algorithm(OWOA)-based optimal key was generated for rectange block cipher to secure each share.This helped in producing high quality reconstruction images.The researcher achieved average experimental outcomes in terms of PSNR and MSE values equal to 55.154225 and 0.79365625 respectively.The average PSNRwas less(49.134475)and average MSE was high(1)in case of existing methods.展开更多
In the setting of(t,n)threshold secret sharing,at least t parties can reconstruct the secret,and fewer than t parties learn nothing about the secret.However,to achieve fairness,the existing secret sharing schemes eith...In the setting of(t,n)threshold secret sharing,at least t parties can reconstruct the secret,and fewer than t parties learn nothing about the secret.However,to achieve fairness,the existing secret sharing schemes either assume a trusted party exists or require running multi-round,which is not practical in a real application.In addition,the cost of verification grows dramatically with the number of participants and the communication complexity is O(t),if there is not a trusted combiner in the reconstruction phase.In this work,we propose a fair server-aided multi-secret sharing scheme for weak computational devices.The malicious behavior of clients or server providers in the scheme can be verified,and the server provider learns nothing about the secret shadows and the secrets.Unlike other secret sharing schemes,our scheme does not require interaction among users and can work in asynchronous mode,which is suitable for mobile networks or cloud computing environments since weak computational mobile devices are not always online.Moreover,in the scheme,the secret shadow is reusable,and expensive computation such as reconstruction computation and homomorphic verification computation can be outsourced to the server provider,and the users only require a small amount of computation.展开更多
In this paper the linear multi-secret sharing schemes are studied by using monotone span programs. A relation between computing monotone Boolean functions by using monotone span programs and realizing multi-access str...In this paper the linear multi-secret sharing schemes are studied by using monotone span programs. A relation between computing monotone Boolean functions by using monotone span programs and realizing multi-access structures by using linear multi-secret sharing schemes is shown. Furthermore, the concept of optimal linear multi-secret sharing scheme is presented and the several schemes are proved to be optimal.展开更多
Corporate environmental sustainability has become a critical concern,particularly in resource-intensive industries such as pharmaceuticals,where regulatory pressures and stakeholder expectations continue to rise.Despi...Corporate environmental sustainability has become a critical concern,particularly in resource-intensive industries such as pharmaceuticals,where regulatory pressures and stakeholder expectations continue to rise.Despite increasing attention to green leadership,limited research has explored how environmentally responsible leadership(ERL)influences corporate environmental performance(CEP)through employee-driven sustainability behaviors.This study addresses this gap by examining the mediating roles of green knowledge-sharing behavior(GKSB),green innovative behavior(GIB),and voluntary green behavior(VGB),as well as the moderating role of green shared vision(GSV)in the ERL-CEP relationship.The study is grounded in Resource-Based View(RBV),Knowledge-Based View(KBV),Environmental-Based View(EBV),and Triple Bottom Line(TBL)theories,which collectively explain how leadership-driven sustainability efforts create long-term competitive advantages,drive environmental responsibility,and balance economic,social,and environmental sustainability.A quantitative research design was employed,using survey data from 384 employees in Bangladesh’s pharmaceutical sector.Data were analyzed using Partial Least Squares Structural Equation Modeling(PLS-SEM)in Smart-PLS 4.0 to assess direct,indirect,and moderating effects.The results confirm that ERL has a significant positive impact on CEP,with GKSB,GIB,and VGB acting as mediators,while GSV strengthens the ERL-CEP relationship.This study provides novel empirical evidence on the mechanisms linking green leadership to corporate sustainability,extending the application of RBV,KBV,EBV,and TBL to leadership-driven environmental management.The findings emphasize the importance of leadership training programs,sustainability-focused organizational cultures,and shared environmental visions.Policymakers should consider incentives for companies adopting ERL practices,ensuring that sustainability becomes a strategic,rather than compliance-driven,priority.This study contributes to leadership and sustainability literature by offering a comprehensive framework for integrating ERL into corporate governance and environmental strategies.展开更多
At the 2024 Beijing Forum on China-Africa Cooperation(FOCAC)held in September last year,Chinese President Xi Jinping proposed that the overall characterisation of China-Africa relations be elevated to an all-weather C...At the 2024 Beijing Forum on China-Africa Cooperation(FOCAC)held in September last year,Chinese President Xi Jinping proposed that the overall characterisation of China-Africa relations be elevated to an all-weather China-Africa community with a shared future for the new era.“This declaration affirms,whether faced with pandemic or geopolitical shifts,Africa and China will still remain each other’s most trustworthy true partners,”said Inkosi Mzamo Buthelezi,South Africa’s minister of public service and administration.展开更多
Amid the increasing demand for data sharing,the need for flexible,secure,and auditable access control mechanisms has garnered significant attention in the academic community.However,blockchain-based ciphertextpolicy a...Amid the increasing demand for data sharing,the need for flexible,secure,and auditable access control mechanisms has garnered significant attention in the academic community.However,blockchain-based ciphertextpolicy attribute-based encryption(CP-ABE)schemes still face cumbersome ciphertext re-encryption and insufficient oversight when handling dynamic attribute changes and cross-chain collaboration.To address these issues,we propose a dynamic permission attribute-encryption scheme for multi-chain collaboration.This scheme incorporates a multiauthority architecture for distributed attribute management and integrates an attribute revocation and granting mechanism that eliminates the need for ciphertext re-encryption,effectively reducing both computational and communication overhead.It leverages the InterPlanetary File System(IPFS)for off-chain data storage and constructs a cross-chain regulatory framework—comprising a Hyperledger Fabric business chain and a FISCO BCOS regulatory chain—to record changes in decryption privileges and access behaviors in an auditable manner.Security analysis shows selective indistinguishability under chosen-plaintext attack(sIND-CPA)security under the decisional q-Parallel Bilinear Diffie-Hellman Exponent Assumption(q-PBDHE).In the performance and experimental evaluations,we compared the proposed scheme with several advanced schemes.The results show that,while preserving security,the proposed scheme achieves higher encryption/decryption efficiency and lower storage overhead for ciphertexts and keys.展开更多
Fifty-five-year-old Shi Yizhong never imagined fireflies could become the foundation of a serious business.In 2022,Longshan Village in Huzhou’s Wuxing District collaborated with a young entrepreneurial team to create...Fifty-five-year-old Shi Yizhong never imagined fireflies could become the foundation of a serious business.In 2022,Longshan Village in Huzhou’s Wuxing District collaborated with a young entrepreneurial team to create a firefly campsite-a natural attraction where visitors can observe these glowing insects in a preserved habitat.The site quickly drew waves of tourists,who shared their experience online,recouping its initial investment in just two years.展开更多
Can the sharing economy contribute to urban sustainability?This study explores this question using the staggered entry of bike-sharing platforms across Chinese cities as a quasi-natural experiment.Drawing on 2015-2017...Can the sharing economy contribute to urban sustainability?This study explores this question using the staggered entry of bike-sharing platforms across Chinese cities as a quasi-natural experiment.Drawing on 2015-2017 city characteristics panel data and monthly CO_(2) emission records,we employ a staggered difference-in-differences(DID)model to assess the impact of bike-sharing on per capita urban CO_(2) emissions.The results show that bike-sharing platforms significantly cut emissions by replacing high-carbon transport and boosting public adoption of shared bikes.This effect is more potent in cities with less stringent environmental enforcement,more advanced digital economies,greater technological innovation,and where two platforms jointly entered.By elucidating the mechanisms underlying bike-sharing’s carbon-reduction potential,this study highlights its role in urban sustainability.It offers policy insights for leveraging shared mobility to reduce city carbon emissions.展开更多
As a Burundian doctoral student at Nanjing University,my personal journey is closely intertwined with China’s development in the new era and the deepening China-Africa partnership.Recently,my experiences have given m...As a Burundian doctoral student at Nanjing University,my personal journey is closely intertwined with China’s development in the new era and the deepening China-Africa partnership.Recently,my experiences have given me a deeper appreciation of the importance of people-to-people exchanges between China and Africa.展开更多
Vehicular communication systems rely on secure vehicle-to-vehicle(V2V)communications for safety-critical information exchange.However,the presence of eavesdropping vehicles poses a significant challenge.This paper inv...Vehicular communication systems rely on secure vehicle-to-vehicle(V2V)communications for safety-critical information exchange.However,the presence of eavesdropping vehicles poses a significant challenge.This paper investigates the security of V2V communications in reconfigurable intelligent surface(RIS)-assisted vehicular communication systems with spectrum sharing.It proposes a three-stage alternating optimization(TSAO)algorithm to address the complex problem of multiple eavesdropped V2V links that reuse the spectrum already occupied by vehicle-toinfrastructure(V2I)links.To solve the mixed-integer and non-convex optimization problem due to coupled variables and complex constraints,the algorithm decomposes the original problem into three easily solvable sub-problems:RIS reflection coefficient optimization,vehicle transmission power optimization,and spectrum sharing optimization.First,the RIS reflection coefficients are optimized by using the penalty convex-concave procedure(CCP)method.Second,the optimal power points are determined in the power optimization sub-problem.Finally,the spectrum sharing optimization sub-problem is constructed as a weighted bipartite graph matching problem and solved by using the optimal matching algorithm.The TSAO algorithm not only maximizes the sum V2V secrecy rate but also ensures the quality-of-service(QoS)requirements of the V2I links.Simulation results validate the superiority of the proposed algorithm and highlight the improvement in the sum V2V secrecy rate achieved by utilizing RIS technology in vehicular communication systems with spectrum sharing.展开更多
In a linear multi-secret sharing scheme with non-threshold structures, several secret values are shared among n participants, and every secret value has a specified access structure. The efficiency of a multi- secret ...In a linear multi-secret sharing scheme with non-threshold structures, several secret values are shared among n participants, and every secret value has a specified access structure. The efficiency of a multi- secret sharing scheme is measured by means of the complexity a and the randomness . Informally, the com- plexity a is the ratio between the maximum of information received by each participant and the minimum of information corresponding to every key. The randomness is the ratio between the amount of information distributed to the set of users U = {1, …, n} and the minimum of information corresponding to every key. In this paper, we discuss a and of any linear multi-secret sharing schemes realized by linear codes with non-threshold structures, and provide two algorithms to make a and to be the minimum, respectively. That is, they are optimal.展开更多
Inspired by the protocol presented by Bagherinezhad and Karimipour[Phys.Rev.A 67(2003) 044302], which will be shown to be insecure,we present a multipartite quantum secret sharing protocol using reusable GreenbergerHo...Inspired by the protocol presented by Bagherinezhad and Karimipour[Phys.Rev.A 67(2003) 044302], which will be shown to be insecure,we present a multipartite quantum secret sharing protocol using reusable GreenbergerHorne -Zeilinger(GHZ) states.This protocol is robust against eavesdropping and could be used for the circumstance of many parties.展开更多
文摘A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange＇s interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one key, that is, a multi-secret sharing scheme has p （〉_ 2） keys. Dealer distribute shares of keys among n participants. Gathering t （〈 n） participants, keys can be reconstructed. Yang et al. （2004） gave a scheme of a （t, n） multi-secret sharing based on Lagrange＇s interpolation. Zhao et al. （2007） gave a scheme of a （t, n） verifiable multi-secret sharing based on Lagrange＇s interpolation. Recently, Adachi and Okazaki give a scheme of a （t, n） multi-secret sharing based on Hermite interpolation, in the case ofp 〈 t. In this paper, we give a scheme ofa （t, n） verifiable multi-secret sharing based on Hermite interpolation.
基金Supported bythe National Basic Research Programof China(973 Program G1999035805)
文摘A multiple secret sharing scheme can share a group of secrets in each sharing session, which is very useful especially in sharing large secrets. However, most of the existing multiple secret sharing schemes are （t, n） threshold schemes, so they are fit for only threshold applications and unfit for the applications of general access structures. Due to the fact that a （t, n） threshold scheme could only handle a small fraction of the secret sharing idea, a novel multi-secret sharing scheme is proposed, which is designed based on general access structures. The security of this scheme is the same as that of Shamir＇s threshold secret sharing scheme. Compared with the existing multiple secret sharing schemes, the proposed scheme can provide greater capabilities for many applications because it is able to deal with applications of general access structures.
文摘To address the problem that existing bipartite secret sharing scheme is short of dynamic characteristic, and to solve the problem that each participant can only use secret share once, this paper proposed a bipartite (n1+n2, m1+m2)-threshold multi-secret sharing scheme which combined cryptography and hypersphere geometry. In this scheme, we introduced a bivariate function and a coordinate function over finite field Zp to calculate the derived points of secret share, which can reconstruct the shared secrets by producing the intersection point of hypernormal plane and normal line on the hypertangent plane. At the initial stage the secret dealer distributes to each participant a secret share that can be kept secret based on the intractability of discrete logarithm problem and need not be changed with updating the shared secrets.Each cooperative participant only needs to submit a derived point calculated from the secret share without exposing this secret share during the process of reconstructing the shared secret. Analyses indicate that the proposed scheme is not only sound and secure because of hypersphere geometric properties and the difficulty of discrete logarithm problem, but also efficient because of its well dynamic behavior and the invariant secret share. Therefore, this bipartite threshold multi-secret sharing scheme is easy to implement and is applicable in practical settings.
文摘Based on Shamir's secret sharing, a (t, n) multi-secret sharing scheme isproposed in this paper p secrets can be shared among n participants, and t or more participants canco-operate to reconstruct these secrets at the same time, but t— 1 or fewerparticipants can derivenothing about these secrets. Each participant's secret shadow is as short as each secret. Comparedwith the existing schemes, the proposed scheme is characterized by the lower complexity of thesecret reconstruction and less public information. The security of this scheme is the same as thatof Shamir' a threshold scheme. Analyses show that this scheme is an efficient, computationallysecure scheme.
基金the National Science Council(Nos.NSC102-2221-E-415-014 and 102-2221-E-415-007)
文摘Visual secret sharing(VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing(VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.
文摘A secret sharing scheme is one of cryptographies. A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange's interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one keys;that is, a multi-secret sharing scheme has p (≥2) keys. Dealers distribute shares of keys among n participants. Gathering t (≤n) participants, keys can be reconstructed. In this paper, we give a scheme of a (t,n) multi-secret sharing based on Hermite interpolation, in the case of p≤t.
基金supported by RUSA PHASE 2.0,Alagappa University,Karaikudi,India。
文摘Cryptography is deemed to be the optimum strategy to secure the data privacy in which the data is encoded ahead of time before sharing it.Visual Secret Sharing(VSS)is an encryption method in which the secret message is split into at least two trivial images called’shares’to cover it.However,such message are always targeted by hackers or dishonest members who attempt to decrypt the message.This can be avoided by not uncovering the secret message without the universal share when it is presented and is typically taken care of,by the trusted party.Hence,in this paper,an optimal and secure double-layered secret image sharing scheme is proposed.The proposed share creation process contains two layers such as threshold-based secret sharing in the first layer and universal share based secret sharing in the second layer.In first layer,Genetic Algorithm(GA)is applied to find the optimal threshold value based on the randomness of the created shares.Then,in the second layer,a novel design of universal share-based secret share creation method is proposed.Finally,Opposition Whale Optimization Algorithm(OWOA)-based optimal key was generated for rectange block cipher to secure each share.This helped in producing high quality reconstruction images.The researcher achieved average experimental outcomes in terms of PSNR and MSE values equal to 55.154225 and 0.79365625 respectively.The average PSNRwas less(49.134475)and average MSE was high(1)in case of existing methods.
基金This work was supported by the National Natural Science Foundation of China(U1604156,61602158,61772176)Science and Technology Research Project of Henan Province(172102210045).
文摘In the setting of(t,n)threshold secret sharing,at least t parties can reconstruct the secret,and fewer than t parties learn nothing about the secret.However,to achieve fairness,the existing secret sharing schemes either assume a trusted party exists or require running multi-round,which is not practical in a real application.In addition,the cost of verification grows dramatically with the number of participants and the communication complexity is O(t),if there is not a trusted combiner in the reconstruction phase.In this work,we propose a fair server-aided multi-secret sharing scheme for weak computational devices.The malicious behavior of clients or server providers in the scheme can be verified,and the server provider learns nothing about the secret shadows and the secrets.Unlike other secret sharing schemes,our scheme does not require interaction among users and can work in asynchronous mode,which is suitable for mobile networks or cloud computing environments since weak computational mobile devices are not always online.Moreover,in the scheme,the secret shadow is reusable,and expensive computation such as reconstruction computation and homomorphic verification computation can be outsourced to the server provider,and the users only require a small amount of computation.
基金supported by the National Natural Science Foundation of China(Grant Nos.60083002,90304012,2004CB318000).
文摘In this paper the linear multi-secret sharing schemes are studied by using monotone span programs. A relation between computing monotone Boolean functions by using monotone span programs and realizing multi-access structures by using linear multi-secret sharing schemes is shown. Furthermore, the concept of optimal linear multi-secret sharing scheme is presented and the several schemes are proved to be optimal.
文摘Corporate environmental sustainability has become a critical concern,particularly in resource-intensive industries such as pharmaceuticals,where regulatory pressures and stakeholder expectations continue to rise.Despite increasing attention to green leadership,limited research has explored how environmentally responsible leadership(ERL)influences corporate environmental performance(CEP)through employee-driven sustainability behaviors.This study addresses this gap by examining the mediating roles of green knowledge-sharing behavior(GKSB),green innovative behavior(GIB),and voluntary green behavior(VGB),as well as the moderating role of green shared vision(GSV)in the ERL-CEP relationship.The study is grounded in Resource-Based View(RBV),Knowledge-Based View(KBV),Environmental-Based View(EBV),and Triple Bottom Line(TBL)theories,which collectively explain how leadership-driven sustainability efforts create long-term competitive advantages,drive environmental responsibility,and balance economic,social,and environmental sustainability.A quantitative research design was employed,using survey data from 384 employees in Bangladesh’s pharmaceutical sector.Data were analyzed using Partial Least Squares Structural Equation Modeling(PLS-SEM)in Smart-PLS 4.0 to assess direct,indirect,and moderating effects.The results confirm that ERL has a significant positive impact on CEP,with GKSB,GIB,and VGB acting as mediators,while GSV strengthens the ERL-CEP relationship.This study provides novel empirical evidence on the mechanisms linking green leadership to corporate sustainability,extending the application of RBV,KBV,EBV,and TBL to leadership-driven environmental management.The findings emphasize the importance of leadership training programs,sustainability-focused organizational cultures,and shared environmental visions.Policymakers should consider incentives for companies adopting ERL practices,ensuring that sustainability becomes a strategic,rather than compliance-driven,priority.This study contributes to leadership and sustainability literature by offering a comprehensive framework for integrating ERL into corporate governance and environmental strategies.
文摘At the 2024 Beijing Forum on China-Africa Cooperation(FOCAC)held in September last year,Chinese President Xi Jinping proposed that the overall characterisation of China-Africa relations be elevated to an all-weather China-Africa community with a shared future for the new era.“This declaration affirms,whether faced with pandemic or geopolitical shifts,Africa and China will still remain each other’s most trustworthy true partners,”said Inkosi Mzamo Buthelezi,South Africa’s minister of public service and administration.
文摘Amid the increasing demand for data sharing,the need for flexible,secure,and auditable access control mechanisms has garnered significant attention in the academic community.However,blockchain-based ciphertextpolicy attribute-based encryption(CP-ABE)schemes still face cumbersome ciphertext re-encryption and insufficient oversight when handling dynamic attribute changes and cross-chain collaboration.To address these issues,we propose a dynamic permission attribute-encryption scheme for multi-chain collaboration.This scheme incorporates a multiauthority architecture for distributed attribute management and integrates an attribute revocation and granting mechanism that eliminates the need for ciphertext re-encryption,effectively reducing both computational and communication overhead.It leverages the InterPlanetary File System(IPFS)for off-chain data storage and constructs a cross-chain regulatory framework—comprising a Hyperledger Fabric business chain and a FISCO BCOS regulatory chain—to record changes in decryption privileges and access behaviors in an auditable manner.Security analysis shows selective indistinguishability under chosen-plaintext attack(sIND-CPA)security under the decisional q-Parallel Bilinear Diffie-Hellman Exponent Assumption(q-PBDHE).In the performance and experimental evaluations,we compared the proposed scheme with several advanced schemes.The results show that,while preserving security,the proposed scheme achieves higher encryption/decryption efficiency and lower storage overhead for ciphertexts and keys.
文摘Fifty-five-year-old Shi Yizhong never imagined fireflies could become the foundation of a serious business.In 2022,Longshan Village in Huzhou’s Wuxing District collaborated with a young entrepreneurial team to create a firefly campsite-a natural attraction where visitors can observe these glowing insects in a preserved habitat.The site quickly drew waves of tourists,who shared their experience online,recouping its initial investment in just two years.
基金supported by the National Natural Science Foundation of China(NSFC)(Grant No.72372048)the“Young Top-Notch Talent”Cultivation Program of Hubei Province.
文摘Can the sharing economy contribute to urban sustainability?This study explores this question using the staggered entry of bike-sharing platforms across Chinese cities as a quasi-natural experiment.Drawing on 2015-2017 city characteristics panel data and monthly CO_(2) emission records,we employ a staggered difference-in-differences(DID)model to assess the impact of bike-sharing on per capita urban CO_(2) emissions.The results show that bike-sharing platforms significantly cut emissions by replacing high-carbon transport and boosting public adoption of shared bikes.This effect is more potent in cities with less stringent environmental enforcement,more advanced digital economies,greater technological innovation,and where two platforms jointly entered.By elucidating the mechanisms underlying bike-sharing’s carbon-reduction potential,this study highlights its role in urban sustainability.It offers policy insights for leveraging shared mobility to reduce city carbon emissions.
文摘As a Burundian doctoral student at Nanjing University,my personal journey is closely intertwined with China’s development in the new era and the deepening China-Africa partnership.Recently,my experiences have given me a deeper appreciation of the importance of people-to-people exchanges between China and Africa.
基金National Natural Science Foundation of China(Nos.61772130,71171045 and 61901104)Innovation Program of Shanghai Municipal Education Commission,China(No.14YZ130)。
文摘Vehicular communication systems rely on secure vehicle-to-vehicle(V2V)communications for safety-critical information exchange.However,the presence of eavesdropping vehicles poses a significant challenge.This paper investigates the security of V2V communications in reconfigurable intelligent surface(RIS)-assisted vehicular communication systems with spectrum sharing.It proposes a three-stage alternating optimization(TSAO)algorithm to address the complex problem of multiple eavesdropped V2V links that reuse the spectrum already occupied by vehicle-toinfrastructure(V2I)links.To solve the mixed-integer and non-convex optimization problem due to coupled variables and complex constraints,the algorithm decomposes the original problem into three easily solvable sub-problems:RIS reflection coefficient optimization,vehicle transmission power optimization,and spectrum sharing optimization.First,the RIS reflection coefficients are optimized by using the penalty convex-concave procedure(CCP)method.Second,the optimal power points are determined in the power optimization sub-problem.Finally,the spectrum sharing optimization sub-problem is constructed as a weighted bipartite graph matching problem and solved by using the optimal matching algorithm.The TSAO algorithm not only maximizes the sum V2V secrecy rate but also ensures the quality-of-service(QoS)requirements of the V2I links.Simulation results validate the superiority of the proposed algorithm and highlight the improvement in the sum V2V secrecy rate achieved by utilizing RIS technology in vehicular communication systems with spectrum sharing.
基金Supported in part by the National Natural Science Foundation of China under Grant No.11271003the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No.20134410110003+3 种基金High Level Talents Project of GuangdongGuangdong Provincial Natural Science Foundation under Grant No.S2012010009950the Project of Department of Education of Guangdong Province under Grant No 2013KJCX0146the Natural Science Foundation of Bureau of Education of Guangzhou under Grant No.2012A004
文摘In a linear multi-secret sharing scheme with non-threshold structures, several secret values are shared among n participants, and every secret value has a specified access structure. The efficiency of a multi- secret sharing scheme is measured by means of the complexity a and the randomness . Informally, the com- plexity a is the ratio between the maximum of information received by each participant and the minimum of information corresponding to every key. The randomness is the ratio between the amount of information distributed to the set of users U = {1, …, n} and the minimum of information corresponding to every key. In this paper, we discuss a and of any linear multi-secret sharing schemes realized by linear codes with non-threshold structures, and provide two algorithms to make a and to be the minimum, respectively. That is, they are optimal.
基金Supported by National Natural Science Foundation of China under Grant Nos.60878059,11004033Natural Science Foundation of Fujian Province under Grant No.2010J01002
文摘Inspired by the protocol presented by Bagherinezhad and Karimipour[Phys.Rev.A 67(2003) 044302], which will be shown to be insecure,we present a multipartite quantum secret sharing protocol using reusable GreenbergerHorne -Zeilinger(GHZ) states.This protocol is robust against eavesdropping and could be used for the circumstance of many parties.
