Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken us...Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken using component failure rate data to predict PTC for a full stroke test and a partial stroke test.Given the subjective and uncertain aspects of the FMEDA approach,specifically the selection of component failure rates and the determination of the probability of detecting failure modes,a Fuzzy Inference System(FIS)was proposed to manage the data,addressing the inherent uncertainties.Fuzzy inference systems have been used previously for various FMEA type assessments,but this is the first time an FIS has been employed for use with FMEDA.ESDV PTC values were generated from both the standard FMEDA and the fuzzy-FMEDA approaches using data provided by FMEDA experts.This work demonstrates that fuzzy inference systems can address the subjectivity inherent in FMEDA data,enabling reliable estimates of ESDV proof test coverage for both full and partial stroke tests.This facilitates optimized maintenance planning while ensuring safety is not compromised.展开更多
V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles c...V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles can distort trust decisions and threaten road safety,privacy-preserving trust management is essential.Lu et al.previously presented BARS,an anonymous reputation mechanism founded on blockchain technology to establish a privacy-preserving trust architecture for V2X communication.In this system,reputation certificates without a vehicle identifier ensure anonymity,while two authorities jointly manage certificate issuance and reputation updates.However,the centralized certificate updates introduce scalability limitations,and the authorities can trace vehicle behavioral information,which threatens privacy guarantees.Several subsequent systems derived from BARS still rely on centralized certificate management and are subject to authority-side privacy leakage.As a result,a key challenge in this line of research remains unresolved:how to decentralize the certificate-update process while preserving privacy against the authorities in privacy-preservingV2X trustmanagement.In this paper,we propose a distributed anonymous reputation system for V2X communication,based on an anonymous reputation system for crowdsensing.In our proposed system for V2X communication,the server is distributed to a certificate authority(CA)and roadside units(RSUs).Each vehicle shows the reputation level to the nearest RSU at the beginning of each time interval,and registers a short-time public key.In the interval,the messages from the vehicle are authenticated under the public key and are scored.At the end of the interval,the nearest RSU updates the certificate anonymously.Our solution decentralizes the certificate-update process by assigning each update to the nearest RSU.A zero-knowledge-proof-based show protocol removes the need for any central authority to handle vehicle certificates and thus prevents the authorities from tracing vehicle activities.Compared with BARS,where centralized authorities must update the reputation certificates of many vehicles and may incur communication and processing delays,our system performs each update locally at the nearest RSUonce per interval.The required interaction consists only of a fewkilobytes of communication and a zero-knowledge proof that is almost fully precomputed on the vehicle side,while the RSU-side processing is estimated to take about 40 ms based on timingmeasurements of the underlying cryptographic operations.This distributed updatemodel avoids the centralized bottleneck of BARS and simultaneously removes the privacy risk arising from authority collusion.展开更多
This paper considers the existence of 3-round zero-knowledge proof systems for NP. Whether there exist 3-round non-black-box zero-knowledge proof systems for NP language is an open problem. By introducing a new intera...This paper considers the existence of 3-round zero-knowledge proof systems for NP. Whether there exist 3-round non-black-box zero-knowledge proof systems for NP language is an open problem. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof system for graph 3-coloring under standard assumptions. Our protocol is a non-black-box zero-knowledge proof because we adopt a special strategy to prove the zero-knowledge property. Consequently, our construction shows the existence of 3-round non-black-box zero-knowledge proof for all languages in NP under the DDH assumption.展开更多
Identity-based hash proof system is a basic and important primitive. Ittographic schemes and protocols that are secure against key-leakage attacks. In thisupdatable identity-based hash proof system, in which the relat...Identity-based hash proof system is a basic and important primitive. Ittographic schemes and protocols that are secure against key-leakage attacks. In thisupdatable identity-based hash proof system, in which the related master secret keyis widely utilized to construct cryp-paper, we introduce the concept ofand the identity secret key can beupdated securely. Then, we instantiate this primitive based on lattices in the standard model. Moreover, we introduce anapplication of this new primitive by giving a generic construction of leakage-resilient public-key encryption schemes withanonymity. This construction can be considered as the integration of the bounded-retrieval model and the continual leakagemodel. Compared with the existing leakage-resilient schemes, our construction not only is more efficient but also can resistmuch more key leakage.展开更多
The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, pr...The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.展开更多
Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have...Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in practice. In this paper, a simple memorizable zero-knowledge protocol is proposed for graph non-isomorphism problem, based on the memorizable interactive proof system, which is extended from the original definition of interactive proof and is more applicable in reality. Keywords interactive proof - zero-knowledge proof - memorizable interactive proof - memorizable zero-knowledge proof This work was supported by the ministry of Science and Technology of China (Grant No.2001CCA03000), and the National Natural Science Foundation of China (Grant No.60273045).Ning Chen received his B.S. degree from Fudan University in 2001. Now he is a master candidate of Department of Computer Science, Fudan University. His research interests include computational complexity, computational cryptography, algorithm design and analysis.Jia-Wei Rong received her B.S. degree from Fudan University in 2002. Now she is a master candidate of Department of Computer Science, Fudan University. Her research interests include computational cryptography, machine learning, artificial intelligence.展开更多
A new explosion-proof walking system was designed for the coal mine rescue robot(CMRR) by optimizing the mechanical structure and control algorithm. The mechanical structure innovation lies mainly in the dual-motor dr...A new explosion-proof walking system was designed for the coal mine rescue robot(CMRR) by optimizing the mechanical structure and control algorithm. The mechanical structure innovation lies mainly in the dual-motor drive tracked unit used, which showed high dynamic performance compared with the conventional tracked unit. The control algorithm, developed based on decision trees and neural networking, facilitates autonomous switching between "Velocity-driven Mode" and "Torquedriven Mode". To verify the feasibility and effectiveness of the control strategy, we built a self-designed test platform and used it to debug the control program; we then made a robot prototype and conducted further experiments on single-step, ramp, and rubble terrains. The results show that the proposed walking system has excellent dynamic performance and the control strategy is very efficient, suggesting that a robot with this type of explosion-proof walking system can be successfully applied in Chinese coal mines.展开更多
Quantitative safety assessment of safety systems plays an important role in decision making at all stages of system lifecycle, i.e., design, deployment and phase out. Most safety assessment methods consider only syste...Quantitative safety assessment of safety systems plays an important role in decision making at all stages of system lifecycle, i.e., design, deployment and phase out. Most safety assessment methods consider only system parameters, such as configuration, hazard rate, coverage, repair rate, etc. along with periodic proof-tests （or inspection）. Not considering demand rate will give a pessimistic safety estimate for an application with low demand rate such as nuclear power plants, chemical plants, etc. In this paper, a basic model of IEC 61508 is used. The basic model is extended to incorporate process demand and behavior of electronic- and/or computer-based system following diagnosis or proof-test. A new safety index, probability of failure on actual demand （PFAD） based on extended model and demand rate is proposed. Periodic proof-test makes the model semi-Markovian, so a piece-wise continuous time Markov chain （CTMC） based method is used to derive mean state probabilities of elementary or aggregated state. Method to determine probability of failure on demand （PFD） （IEC 61508） and PFAD based on these state probabilities are described. In example, safety indices of PFD and PFAD are compared.展开更多
This paper introduces the Integrated Security Embedded Resilience Architecture (ISERA) as an advanced resilience mechanism for Industrial Control Systems (ICS) and Operational Technology (OT) environments. The ISERA f...This paper introduces the Integrated Security Embedded Resilience Architecture (ISERA) as an advanced resilience mechanism for Industrial Control Systems (ICS) and Operational Technology (OT) environments. The ISERA framework integrates security by design principles, micro-segmentation, and Island Mode Operation (IMO) to enhance cyber resilience and ensure continuous, secure operations. The methodology deploys a Forward-Thinking Architecture Strategy (FTAS) algorithm, which utilises an industrial Intrusion Detection System (IDS) implemented with Python’s Network Intrusion Detection System (NIDS) library. The FTAS algorithm successfully identified and responded to cyber-attacks, ensuring minimal system disruption. ISERA has been validated through comprehensive testing scenarios simulating Denial of Service (DoS) attacks and malware intrusions, at both the IT and OT layers where it successfully mitigates the impact of malicious activity. Results demonstrate ISERA’s efficacy in real-time threat detection, containment, and incident response, thus ensuring the integrity and reliability of critical infrastructure systems. ISERA’s decentralised approach contributes to global net zero goals by optimising resource use and minimising environmental impact. By adopting a decentralised control architecture and leveraging virtualisation, ISERA significantly enhances the cyber resilience and sustainability of critical infrastructure systems. This approach not only strengthens defences against evolving cyber threats but also optimises resource allocation, reducing the system’s carbon footprint. As a result, ISERA ensures the uninterrupted operation of essential services while contributing to broader net zero goals.展开更多
In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic q...In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic queries.Additionally,they typically rely on honest but curious cloud servers,which introduces the risk of repudiation.Furthermore,the combined operations of search and verification increase system load,thereby reducing performance.Traditional verification mechanisms,which rely on complex hash constructions,suffer from low verification efficiency.To address these challenges,this paper proposes a blockchain-based contextual semantic-aware ciphertext retrieval scheme with efficient verification.Building on existing single and multi-keyword search methods,the scheme uses vector models to semantically train the dataset,enabling it to retain semantic information and achieve context-aware encrypted retrieval,significantly improving search accuracy.Additionally,a blockchain-based updatable master-slave chain storage model is designed,where the master chain stores encrypted keyword indexes and the slave chain stores verification information generated by zero-knowledge proofs,thus balancing system load while improving search and verification efficiency.Finally,an improved non-interactive zero-knowledge proof mechanism is introduced,reducing the computational complexity of verification and ensuring efficient validation of search results.Experimental results demonstrate that the proposed scheme offers stronger security,balanced overhead,and higher search verification efficiency.展开更多
The next-generation RAN,known as Open Radio Access Network(ORAN),allows for several advantages,including cost-effectiveness,network flexibility,and interoperability.Now ORAN applications,utilising machine learning(ML)...The next-generation RAN,known as Open Radio Access Network(ORAN),allows for several advantages,including cost-effectiveness,network flexibility,and interoperability.Now ORAN applications,utilising machine learning(ML)and artificial intelligence(AI)techniques,have become standard practice.The need for Federated Learning(FL)for ML model training in ORAN environments is heightened by the modularised structure of the ORAN architecture and the shortcomings of conventional ML techniques.However,the traditional plaintext model update sharing of FL in multi-BS contexts is susceptible to privacy violations such as deep-leakage gradient assaults and inference.Therefore,this research presents a novel blockchain-assisted improved cryptographic privacy-preserving federated learning(BICPPFL)model,with the help of ORAN,to safely carry out federated learning and protect privacy.This model improves on the conventional masking technique for sharing model parameters by adding new characteristics.These features include the choice of distributed aggregators,validation for final model aggregation,and individual validation for BSs.To manage the security and privacy of FL processes,a combined homomorphic proxy-reencryption(HPReE)and lattice-cryptographic method(HPReEL)has been used.The upgraded delegated proof of stake(Up-DPoS)consensus protocol,which will provide quick validation of model exchanges and protect against malicious attacks,is employed for effective consensus across blockchain nodes.Without sacrificing performance metrics,the BICPPFL model strengthens privacy and adds security layers while facilitating the transfer of sensitive data across several BSs.The framework is deployed on top of a Hyperledger Fabric blockchain to evaluate its effectiveness.The experimental findings prove the reliability and privacy-preserving capability of the BICPPFL model.展开更多
电影歌曲作为整部电影的有机组成部分,其重要性不可小觑,一首好的歌曲能达到锦上添花的观影效果。目前国内对电影歌词的研究,大多集中在音乐学、美学、文学等语言学之外的领域,从功能语言学的角度对电影歌曲的解读尚且不多。本文拟以系...电影歌曲作为整部电影的有机组成部分,其重要性不可小觑,一首好的歌曲能达到锦上添花的观影效果。目前国内对电影歌词的研究,大多集中在音乐学、美学、文学等语言学之外的领域,从功能语言学的角度对电影歌曲的解读尚且不多。本文拟以系统功能语法理论为指导,从语境、经验功能、人际功能着手解析电影《相助》片尾曲《The Living Proof》,以期丰富系统功能语法的研究内容,为电影歌词的分析提供新的视角,帮助观影者深度理解影片主题。展开更多
The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model ...The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model （BPR2000） and the Canetti ＆ Krawczyk （2001） model （CK2001） are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.展开更多
In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independe...In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independednt variable u, but is not differentiable with respect to the dependent variable u=g(x). A strict proof of Chain Rule is presented. Incon sistency of the form and content of Chain Rule is disclosed.展开更多
文摘Published proof test coverage(PTC)estimates for emergency shutdown valves(ESDVs)show only moderate agreement and are predominantly opinion-based.A Failure Modes,Effects,and Diagnostics Analysis(FMEDA)was undertaken using component failure rate data to predict PTC for a full stroke test and a partial stroke test.Given the subjective and uncertain aspects of the FMEDA approach,specifically the selection of component failure rates and the determination of the probability of detecting failure modes,a Fuzzy Inference System(FIS)was proposed to manage the data,addressing the inherent uncertainties.Fuzzy inference systems have been used previously for various FMEA type assessments,but this is the first time an FIS has been employed for use with FMEDA.ESDV PTC values were generated from both the standard FMEDA and the fuzzy-FMEDA approaches using data provided by FMEDA experts.This work demonstrates that fuzzy inference systems can address the subjectivity inherent in FMEDA data,enabling reliable estimates of ESDV proof test coverage for both full and partial stroke tests.This facilitates optimized maintenance planning while ensuring safety is not compromised.
文摘V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles can distort trust decisions and threaten road safety,privacy-preserving trust management is essential.Lu et al.previously presented BARS,an anonymous reputation mechanism founded on blockchain technology to establish a privacy-preserving trust architecture for V2X communication.In this system,reputation certificates without a vehicle identifier ensure anonymity,while two authorities jointly manage certificate issuance and reputation updates.However,the centralized certificate updates introduce scalability limitations,and the authorities can trace vehicle behavioral information,which threatens privacy guarantees.Several subsequent systems derived from BARS still rely on centralized certificate management and are subject to authority-side privacy leakage.As a result,a key challenge in this line of research remains unresolved:how to decentralize the certificate-update process while preserving privacy against the authorities in privacy-preservingV2X trustmanagement.In this paper,we propose a distributed anonymous reputation system for V2X communication,based on an anonymous reputation system for crowdsensing.In our proposed system for V2X communication,the server is distributed to a certificate authority(CA)and roadside units(RSUs).Each vehicle shows the reputation level to the nearest RSU at the beginning of each time interval,and registers a short-time public key.In the interval,the messages from the vehicle are authenticated under the public key and are scored.At the end of the interval,the nearest RSU updates the certificate anonymously.Our solution decentralizes the certificate-update process by assigning each update to the nearest RSU.A zero-knowledge-proof-based show protocol removes the need for any central authority to handle vehicle certificates and thus prevents the authorities from tracing vehicle activities.Compared with BARS,where centralized authorities must update the reputation certificates of many vehicles and may incur communication and processing delays,our system performs each update locally at the nearest RSUonce per interval.The required interaction consists only of a fewkilobytes of communication and a zero-knowledge proof that is almost fully precomputed on the vehicle side,while the RSU-side processing is estimated to take about 40 ms based on timingmeasurements of the underlying cryptographic operations.This distributed updatemodel avoids the centralized bottleneck of BARS and simultaneously removes the privacy risk arising from authority collusion.
基金Supported by the National Natural Science Foundation of China (Grant Nos. 60573052 and 90304013)
文摘This paper considers the existence of 3-round zero-knowledge proof systems for NP. Whether there exist 3-round non-black-box zero-knowledge proof systems for NP language is an open problem. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof system for graph 3-coloring under standard assumptions. Our protocol is a non-black-box zero-knowledge proof because we adopt a special strategy to prove the zero-knowledge property. Consequently, our construction shows the existence of 3-round non-black-box zero-knowledge proof for all languages in NP under the DDH assumption.
基金This work was supported by the National Key Research and Development Program of China under Grant No. 2017YFt30802000, the National Natural Science Foundation of China under Grant Nos. 61802241, 61772326, 61572303, 61872229, 61802242, and 61602290, the National Natural Science Foundation of China for International Young Scientists under Grant No. 61750110528, the National Cryp-tographv Development Fund during the 13th Five-Year Plan Period of China under Grant Nos. MMJJ20170216 and MMJJ20180217, the Foundation of State Key Laboratory of Information Security of China under Grant No. 2017-MS-03, and the Fundamental Re- search Funds for the Central Universities of China under Grant Nos. GK201603084, GK201702004, GK201603092, GK201603093, and GK201703062.
文摘Identity-based hash proof system is a basic and important primitive. Ittographic schemes and protocols that are secure against key-leakage attacks. In thisupdatable identity-based hash proof system, in which the related master secret keyis widely utilized to construct cryp-paper, we introduce the concept ofand the identity secret key can beupdated securely. Then, we instantiate this primitive based on lattices in the standard model. Moreover, we introduce anapplication of this new primitive by giving a generic construction of leakage-resilient public-key encryption schemes withanonymity. This construction can be considered as the integration of the bounded-retrieval model and the continual leakagemodel. Compared with the existing leakage-resilient schemes, our construction not only is more efficient but also can resistmuch more key leakage.
基金supported by the National Natural Science Foundation of China(Grant No.41371402)the National Basic Research Program of China("973"Program)(Grant No.2011CB302306)the Fundamental Research Funds for the Central University(Grant No.2015211020201 and No.211274230)
文摘The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.
文摘Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in practice. In this paper, a simple memorizable zero-knowledge protocol is proposed for graph non-isomorphism problem, based on the memorizable interactive proof system, which is extended from the original definition of interactive proof and is more applicable in reality. Keywords interactive proof - zero-knowledge proof - memorizable interactive proof - memorizable zero-knowledge proof This work was supported by the ministry of Science and Technology of China (Grant No.2001CCA03000), and the National Natural Science Foundation of China (Grant No.60273045).Ning Chen received his B.S. degree from Fudan University in 2001. Now he is a master candidate of Department of Computer Science, Fudan University. His research interests include computational complexity, computational cryptography, algorithm design and analysis.Jia-Wei Rong received her B.S. degree from Fudan University in 2002. Now she is a master candidate of Department of Computer Science, Fudan University. Her research interests include computational cryptography, machine learning, artificial intelligence.
基金Project(2012AA041504)supported by the National High-Tech Research and Development Program of ChinaProject(KYLX15_1418)supported by the 2015 Annual General University Graduate Research and Innovation Program of Jiangsu Province,ChinaProject supported by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD),China
文摘A new explosion-proof walking system was designed for the coal mine rescue robot(CMRR) by optimizing the mechanical structure and control algorithm. The mechanical structure innovation lies mainly in the dual-motor drive tracked unit used, which showed high dynamic performance compared with the conventional tracked unit. The control algorithm, developed based on decision trees and neural networking, facilitates autonomous switching between "Velocity-driven Mode" and "Torquedriven Mode". To verify the feasibility and effectiveness of the control strategy, we built a self-designed test platform and used it to debug the control program; we then made a robot prototype and conducted further experiments on single-step, ramp, and rubble terrains. The results show that the proposed walking system has excellent dynamic performance and the control strategy is very efficient, suggesting that a robot with this type of explosion-proof walking system can be successfully applied in Chinese coal mines.
文摘Quantitative safety assessment of safety systems plays an important role in decision making at all stages of system lifecycle, i.e., design, deployment and phase out. Most safety assessment methods consider only system parameters, such as configuration, hazard rate, coverage, repair rate, etc. along with periodic proof-tests （or inspection）. Not considering demand rate will give a pessimistic safety estimate for an application with low demand rate such as nuclear power plants, chemical plants, etc. In this paper, a basic model of IEC 61508 is used. The basic model is extended to incorporate process demand and behavior of electronic- and/or computer-based system following diagnosis or proof-test. A new safety index, probability of failure on actual demand （PFAD） based on extended model and demand rate is proposed. Periodic proof-test makes the model semi-Markovian, so a piece-wise continuous time Markov chain （CTMC） based method is used to derive mean state probabilities of elementary or aggregated state. Method to determine probability of failure on demand （PFD） （IEC 61508） and PFAD based on these state probabilities are described. In example, safety indices of PFD and PFAD are compared.
基金funded by the Office of Gas and Electricity Markets(Ofgem)and supported by De Montfort University(DMU)and Nottingham Trent University(NTU),UK.
文摘This paper introduces the Integrated Security Embedded Resilience Architecture (ISERA) as an advanced resilience mechanism for Industrial Control Systems (ICS) and Operational Technology (OT) environments. The ISERA framework integrates security by design principles, micro-segmentation, and Island Mode Operation (IMO) to enhance cyber resilience and ensure continuous, secure operations. The methodology deploys a Forward-Thinking Architecture Strategy (FTAS) algorithm, which utilises an industrial Intrusion Detection System (IDS) implemented with Python’s Network Intrusion Detection System (NIDS) library. The FTAS algorithm successfully identified and responded to cyber-attacks, ensuring minimal system disruption. ISERA has been validated through comprehensive testing scenarios simulating Denial of Service (DoS) attacks and malware intrusions, at both the IT and OT layers where it successfully mitigates the impact of malicious activity. Results demonstrate ISERA’s efficacy in real-time threat detection, containment, and incident response, thus ensuring the integrity and reliability of critical infrastructure systems. ISERA’s decentralised approach contributes to global net zero goals by optimising resource use and minimising environmental impact. By adopting a decentralised control architecture and leveraging virtualisation, ISERA significantly enhances the cyber resilience and sustainability of critical infrastructure systems. This approach not only strengthens defences against evolving cyber threats but also optimises resource allocation, reducing the system’s carbon footprint. As a result, ISERA ensures the uninterrupted operation of essential services while contributing to broader net zero goals.
基金supported in part by the National Natural Science Foundation of China under Grant 62262073in part by the Yunnan Provincial Ten Thousand People Program for Young Top Talents under Grant YNWR-QNBJ-2019-237in part by the Yunnan Provincial Major Science and Technology Special Program under Grant 202402AD080002.
文摘In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic queries.Additionally,they typically rely on honest but curious cloud servers,which introduces the risk of repudiation.Furthermore,the combined operations of search and verification increase system load,thereby reducing performance.Traditional verification mechanisms,which rely on complex hash constructions,suffer from low verification efficiency.To address these challenges,this paper proposes a blockchain-based contextual semantic-aware ciphertext retrieval scheme with efficient verification.Building on existing single and multi-keyword search methods,the scheme uses vector models to semantically train the dataset,enabling it to retain semantic information and achieve context-aware encrypted retrieval,significantly improving search accuracy.Additionally,a blockchain-based updatable master-slave chain storage model is designed,where the master chain stores encrypted keyword indexes and the slave chain stores verification information generated by zero-knowledge proofs,thus balancing system load while improving search and verification efficiency.Finally,an improved non-interactive zero-knowledge proof mechanism is introduced,reducing the computational complexity of verification and ensuring efficient validation of search results.Experimental results demonstrate that the proposed scheme offers stronger security,balanced overhead,and higher search verification efficiency.
文摘The next-generation RAN,known as Open Radio Access Network(ORAN),allows for several advantages,including cost-effectiveness,network flexibility,and interoperability.Now ORAN applications,utilising machine learning(ML)and artificial intelligence(AI)techniques,have become standard practice.The need for Federated Learning(FL)for ML model training in ORAN environments is heightened by the modularised structure of the ORAN architecture and the shortcomings of conventional ML techniques.However,the traditional plaintext model update sharing of FL in multi-BS contexts is susceptible to privacy violations such as deep-leakage gradient assaults and inference.Therefore,this research presents a novel blockchain-assisted improved cryptographic privacy-preserving federated learning(BICPPFL)model,with the help of ORAN,to safely carry out federated learning and protect privacy.This model improves on the conventional masking technique for sharing model parameters by adding new characteristics.These features include the choice of distributed aggregators,validation for final model aggregation,and individual validation for BSs.To manage the security and privacy of FL processes,a combined homomorphic proxy-reencryption(HPReE)and lattice-cryptographic method(HPReEL)has been used.The upgraded delegated proof of stake(Up-DPoS)consensus protocol,which will provide quick validation of model exchanges and protect against malicious attacks,is employed for effective consensus across blockchain nodes.Without sacrificing performance metrics,the BICPPFL model strengthens privacy and adds security layers while facilitating the transfer of sensitive data across several BSs.The framework is deployed on top of a Hyperledger Fabric blockchain to evaluate its effectiveness.The experimental findings prove the reliability and privacy-preserving capability of the BICPPFL model.
文摘电影歌曲作为整部电影的有机组成部分,其重要性不可小觑,一首好的歌曲能达到锦上添花的观影效果。目前国内对电影歌词的研究,大多集中在音乐学、美学、文学等语言学之外的领域,从功能语言学的角度对电影歌曲的解读尚且不多。本文拟以系统功能语法理论为指导,从语境、经验功能、人际功能着手解析电影《相助》片尾曲《The Living Proof》,以期丰富系统功能语法的研究内容,为电影歌词的分析提供新的视角,帮助观影者深度理解影片主题。
文摘The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model （BPR2000） and the Canetti ＆ Krawczyk （2001） model （CK2001） are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.
文摘In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independednt variable u, but is not differentiable with respect to the dependent variable u=g(x). A strict proof of Chain Rule is presented. Incon sistency of the form and content of Chain Rule is disclosed.
