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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
The accelerated advancement of the Internet of Things(IoT)has generated substantial data,including sensitive and private information.Consequently,it is imperative to guarantee the security of data sharing.While facili...The accelerated advancement of the Internet of Things(IoT)has generated substantial data,including sensitive and private information.Consequently,it is imperative to guarantee the security of data sharing.While facilitating fine-grained access control,Ciphertext Policy Attribute-Based Encryption(CP-ABE)can effectively ensure the confidentiality of shared data.Nevertheless,the conventional centralized CP-ABE scheme is plagued by the issues of keymisuse,key escrow,and large computation,which will result in security risks.This paper suggests a lightweight IoT data security sharing scheme that integrates blockchain technology and CP-ABE to address the abovementioned issues.The integrity and traceability of shared data are guaranteed by the use of blockchain technology to store and verify access transactions.The encryption and decryption operations of the CP-ABE algorithm have been implemented using elliptic curve scalarmultiplication to accommodate lightweight IoT devices,as opposed to themore arithmetic bilinear pairing found in the traditional CP-ABE algorithm.Additionally,a portion of the computation is delegated to the edge nodes to alleviate the computational burden on users.A distributed key management method is proposed to address the issues of key escrow andmisuse.Thismethod employs the edge blockchain to facilitate the storage and distribution of attribute private keys.Meanwhile,data security sharing is enhanced by combining off-chain and on-chain ciphertext storage.The security and performance analysis indicates that the proposed scheme is more efficient and secure.展开更多
With the increasing popularity of blockchain applications, the security of data sources on the blockchain is gradually receiving attention. Providing reliable data for the blockchain safely and efficiently has become ...With the increasing popularity of blockchain applications, the security of data sources on the blockchain is gradually receiving attention. Providing reliable data for the blockchain safely and efficiently has become a research hotspot, and the security of the oracle responsible for providing reliable data has attracted much attention. The most widely used centralized oracles in blockchain, such as Provable and Town Crier, all rely on a single oracle to obtain data, which suffers from a single point of failure and limits the large-scale development of blockchain. To this end, the distributed oracle scheme is put forward, but the existing distributed oracle schemes such as Chainlink and Augur generally have low execution efficiency and high communication overhead, which leads to their poor applicability. To solve the above problems, this paper proposes a trusted distributed oracle scheme based on a share recovery threshold signature. First, a data verification method of distributed oracles is designed based on threshold signature. By aggregating the signatures of oracles, data from different data sources can be mutually verified, leading to a more efficient data verification and aggregation process. Then, a credibility-based cluster head election algorithm is designed, which reduces the communication overhead by clarifying the function distribution and building a hierarchical structure. Considering the good performance of the BLS threshold signature in large-scale applications, this paper combines it with distributed oracle technology and proposes a BLS threshold signature algorithm that supports share recovery in distributed oracles. The share recovery mechanism enables the proposed scheme to solve the key loss issue, and the setting of the threshold value enables the proposed scheme to complete signature aggregation with only a threshold number of oracles, making the scheme more robust. Finally, experimental results indicate that, by using the threshold signature technology and the cluster head election algorithm, our scheme effectively improves the execution efficiency of oracles and solves the problem of a single point of failure, leading to higher scalability and robustness.展开更多
Burden sharing has been a perennial issue in the transatlantic alliance,primarily entailing cost sharing and responsibility sharing.During the first Trump administration,the dispute over cost sharing had been prominen...Burden sharing has been a perennial issue in the transatlantic alliance,primarily entailing cost sharing and responsibility sharing.During the first Trump administration,the dispute over cost sharing had been prominent,while the Biden administration placed more emphasis on responsibility sharing to facilitate its strategic goal of“outcompeting”China.The Ukraine crisis had prompted a US-Europe consensus on cost sharing,but the urgency of responsibility sharing subsequently increased.The shift from jointly providing the economic resources to extensively sharing the security responsibilities ref lects the recalibration of the US strategic focus and its higher expectations for the role of European allies.Nevertheless,Europe's response to the US call for responsibility sharing has been relatively limited.The responsibility sharing within the US-Europe alliance and their future relationship will be subject to the strategic coordination between the two sides and multiple complex factors.展开更多
A Malawian perspective on China’s influence,innovation and shared growth In today’s interconnected world,diplomacy,trade,and culture are drawing nations once thought distant closer.A case in point is the growing rel...A Malawian perspective on China’s influence,innovation and shared growth In today’s interconnected world,diplomacy,trade,and culture are drawing nations once thought distant closer.A case in point is the growing relationship between Malawi and China-two geographically and historically distinct countries that are finding powerful common ground and shared aspirations.展开更多
The concept of a community with a shared future for humanity is the core idea of Xi Jinping thought on diplomacy.Since its introduction,this concept has been steadily advanced across various levels and sectors,yieldin...The concept of a community with a shared future for humanity is the core idea of Xi Jinping thought on diplomacy.Since its introduction,this concept has been steadily advanced across various levels and sectors,yielding tangible and meaningful results.Within Chinese academia,the idea of a community with a shared future for humanity,along with the important idea of a maritime community with a shared future,has been integrated into research on South China Sea issues.Scholars have explored China’s approach to establishing regional order in the South China Sea from multiple perspectives,including territorial dispute resolution,maritime rights and interests’protection,environmental conservation,and port cooperation.展开更多
From April 8 to 9,2025,the Cent ral Conference on Work Related to Neighboring Countries was held in Beijing.The conference systematically summarized the achievements and experience of China's neighborhood work in ...From April 8 to 9,2025,the Cent ral Conference on Work Related to Neighboring Countries was held in Beijing.The conference systematically summarized the achievements and experience of China's neighborhood work in the new era,scientifically analyzed the situation,clarified the goals,tasks,ideas,and measures for neighborhood work in the coming period,and emphasized the need to focus on building a community with a shared future with neighboring countries,striving to break new ground in neighborhood work.展开更多
As an important part of China's neighborhood,Southeast Asia has always been a high priority in China's neighborhood diplomacy,playing a benchmark and example-setting role in China's drive to build a commun...As an important part of China's neighborhood,Southeast Asia has always been a high priority in China's neighborhood diplomacy,playing a benchmark and example-setting role in China's drive to build a community with a shared future with neighboring countries.Shortly after the 2025 Central Conference on Work Related to Neighboring Countries,Chinese President Xi Jinping paid state visits to Vietnam,Malaysia,and Cambodia.展开更多
基金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.
文摘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.
基金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.
文摘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.
基金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.
文摘The accelerated advancement of the Internet of Things(IoT)has generated substantial data,including sensitive and private information.Consequently,it is imperative to guarantee the security of data sharing.While facilitating fine-grained access control,Ciphertext Policy Attribute-Based Encryption(CP-ABE)can effectively ensure the confidentiality of shared data.Nevertheless,the conventional centralized CP-ABE scheme is plagued by the issues of keymisuse,key escrow,and large computation,which will result in security risks.This paper suggests a lightweight IoT data security sharing scheme that integrates blockchain technology and CP-ABE to address the abovementioned issues.The integrity and traceability of shared data are guaranteed by the use of blockchain technology to store and verify access transactions.The encryption and decryption operations of the CP-ABE algorithm have been implemented using elliptic curve scalarmultiplication to accommodate lightweight IoT devices,as opposed to themore arithmetic bilinear pairing found in the traditional CP-ABE algorithm.Additionally,a portion of the computation is delegated to the edge nodes to alleviate the computational burden on users.A distributed key management method is proposed to address the issues of key escrow andmisuse.Thismethod employs the edge blockchain to facilitate the storage and distribution of attribute private keys.Meanwhile,data security sharing is enhanced by combining off-chain and on-chain ciphertext storage.The security and performance analysis indicates that the proposed scheme is more efficient and secure.
基金supported by the National Natural Science Foundation of China(Grant No.62102449)the Central Plains Talent Program under Grant No.224200510003.
文摘With the increasing popularity of blockchain applications, the security of data sources on the blockchain is gradually receiving attention. Providing reliable data for the blockchain safely and efficiently has become a research hotspot, and the security of the oracle responsible for providing reliable data has attracted much attention. The most widely used centralized oracles in blockchain, such as Provable and Town Crier, all rely on a single oracle to obtain data, which suffers from a single point of failure and limits the large-scale development of blockchain. To this end, the distributed oracle scheme is put forward, but the existing distributed oracle schemes such as Chainlink and Augur generally have low execution efficiency and high communication overhead, which leads to their poor applicability. To solve the above problems, this paper proposes a trusted distributed oracle scheme based on a share recovery threshold signature. First, a data verification method of distributed oracles is designed based on threshold signature. By aggregating the signatures of oracles, data from different data sources can be mutually verified, leading to a more efficient data verification and aggregation process. Then, a credibility-based cluster head election algorithm is designed, which reduces the communication overhead by clarifying the function distribution and building a hierarchical structure. Considering the good performance of the BLS threshold signature in large-scale applications, this paper combines it with distributed oracle technology and proposes a BLS threshold signature algorithm that supports share recovery in distributed oracles. The share recovery mechanism enables the proposed scheme to solve the key loss issue, and the setting of the threshold value enables the proposed scheme to complete signature aggregation with only a threshold number of oracles, making the scheme more robust. Finally, experimental results indicate that, by using the threshold signature technology and the cluster head election algorithm, our scheme effectively improves the execution efficiency of oracles and solves the problem of a single point of failure, leading to higher scalability and robustness.
文摘Burden sharing has been a perennial issue in the transatlantic alliance,primarily entailing cost sharing and responsibility sharing.During the first Trump administration,the dispute over cost sharing had been prominent,while the Biden administration placed more emphasis on responsibility sharing to facilitate its strategic goal of“outcompeting”China.The Ukraine crisis had prompted a US-Europe consensus on cost sharing,but the urgency of responsibility sharing subsequently increased.The shift from jointly providing the economic resources to extensively sharing the security responsibilities ref lects the recalibration of the US strategic focus and its higher expectations for the role of European allies.Nevertheless,Europe's response to the US call for responsibility sharing has been relatively limited.The responsibility sharing within the US-Europe alliance and their future relationship will be subject to the strategic coordination between the two sides and multiple complex factors.
文摘A Malawian perspective on China’s influence,innovation and shared growth In today’s interconnected world,diplomacy,trade,and culture are drawing nations once thought distant closer.A case in point is the growing relationship between Malawi and China-two geographically and historically distinct countries that are finding powerful common ground and shared aspirations.
文摘The concept of a community with a shared future for humanity is the core idea of Xi Jinping thought on diplomacy.Since its introduction,this concept has been steadily advanced across various levels and sectors,yielding tangible and meaningful results.Within Chinese academia,the idea of a community with a shared future for humanity,along with the important idea of a maritime community with a shared future,has been integrated into research on South China Sea issues.Scholars have explored China’s approach to establishing regional order in the South China Sea from multiple perspectives,including territorial dispute resolution,maritime rights and interests’protection,environmental conservation,and port cooperation.
文摘From April 8 to 9,2025,the Cent ral Conference on Work Related to Neighboring Countries was held in Beijing.The conference systematically summarized the achievements and experience of China's neighborhood work in the new era,scientifically analyzed the situation,clarified the goals,tasks,ideas,and measures for neighborhood work in the coming period,and emphasized the need to focus on building a community with a shared future with neighboring countries,striving to break new ground in neighborhood work.
文摘As an important part of China's neighborhood,Southeast Asia has always been a high priority in China's neighborhood diplomacy,playing a benchmark and example-setting role in China's drive to build a community with a shared future with neighboring countries.Shortly after the 2025 Central Conference on Work Related to Neighboring Countries,Chinese President Xi Jinping paid state visits to Vietnam,Malaysia,and Cambodia.
