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.展开更多
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.展开更多
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 study conducts a systematic literature review(SLR)of blockchain consensus mechanisms,an essential protocols that maintain the integrity,reliability,and decentralization of distributed ledger networks.The aim is t...This study conducts a systematic literature review(SLR)of blockchain consensus mechanisms,an essential protocols that maintain the integrity,reliability,and decentralization of distributed ledger networks.The aim is to comprehensively investigate prominent mechanisms’security features and vulnerabilities,emphasizing their security considerations,applications,challenges,and future directions.The existing literature offers valuable insights into various consensus mechanisms’strengths,limitations,and security vulnerabilities and their real-world applications.However,there remains a gap in synthesizing and analyzing this knowledge systematically.Addressing this gap would facilitate a structured approach to understanding consensus mechanisms’security and vulnerabilities comprehensively.The study adheres to Preferred Reporting Items for Systematic Reviews and Meta-Analyses(PRISMA)guidelines and computer science standards and reviewed 3749 research papers from 2016 to 2024,excluding grey literature,resulting in 290 articles for descriptive analysis.The research highlights an increased focus on blockchain consensus security,energy efficiency,and hybrid mechanisms within 60%of research papers post-2019,identifying gaps in scalability,privacy,and interoperability for future exploration.By synthesizing the existing research and identifying the key trends,this SLR contributes to advancing the understanding of blockchain consensus mechanisms’security and guiding future research and structured innovation in blockchain systems and applications.展开更多
This is the fifth paper in a series on Time Dilation Cosmology, TDC. TDC is an eternal holographic model of the universe based on time dilation that ties astrophysics to quantum physics and resolves all the conundrums...This is the fifth paper in a series on Time Dilation Cosmology, TDC. TDC is an eternal holographic model of the universe based on time dilation that ties astrophysics to quantum physics and resolves all the conundrums in astrophysics and serves as a model for the unified field. In the author’s previous four TDC papers, it was demonstrated that all gravitationally induced velocities are compensation for the apparent difference in the rates of time, “dRt”, due to mass/energy densities, and, vice-versa, in all force-induced velocities the dRt is compensation for the velocity, so the uniform evolution of the continuum at c is maintained at the invariant 1 s/s rate of time of the universe as a whole. These compensations make it impossible for an event to lag behind or get ahead of the evolving continuum. When the author did the first velocity formula derivations in “General Relativity: Effects in Time as Causation” [1], the author felt the explanations for the appearance of the 2spatial and the 3temporal acceleration factors in the formulas were correct, but poorly explained and incomplete. This paper is a proof of the temporal and spatial acceleration factors used in the time dilation-based velocity formula derivations in the Time Dilation Cosmology model.展开更多
Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells c...Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.展开更多
There is an error in the name of the cell line in the abstract of the published paper“MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons”published on pages 2698-2707,Issue 12,Volume 19 of Ne...There is an error in the name of the cell line in the abstract of the published paper“MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons”published on pages 2698-2707,Issue 12,Volume 19 of Neural Regeneration Research(Sharma et al.,2024),because of oversight during final proof checking.The correct description should be“human-GABA receptor A-α1/β2/γ2L human embryonic kidney(HEK)recombinant cell line.”The authors apologize for any inconvenience this correction may cause for readers and editors of Neural Regeneration Research.展开更多
The security of information transmission and processing due to unknown vulnerabilities and backdoors in cyberspace is becoming increasingly problematic.However,there is a lack of effective theory to mathematically dem...The security of information transmission and processing due to unknown vulnerabilities and backdoors in cyberspace is becoming increasingly problematic.However,there is a lack of effective theory to mathematically demonstrate the security of information transmission and processing under nonrandom noise(or vulnerability backdoor attack)conditions in cyberspace.This paper first proposes a security model for cyberspace information transmission and processing channels based on error correction coding theory.First,we analyze the fault tolerance and non-randomness problem of Dynamic Heterogeneous Redundancy(DHR)structured information transmission and processing channel under the condition of non-random noise or attacks.Secondly,we use a mathematical statistical method to demonstrate that for non-random noise(or attacks)on discrete memory channels,there exists a DHR-structured channel and coding scheme that enables the average system error probability to be arbitrarily small.Finally,to construct suitable coding and heterogeneous channels,we take Turbo code as an example and simulate the effects of different heterogeneity,redundancy,output vector length,verdict algorithm and dynamism on the system,which is an important guidance for theory and engineering practice.展开更多
文摘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.
基金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 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 Universiti Teknologi PETRONAS and grants(YUTP-PRG:015PBC-011).
文摘This study conducts a systematic literature review(SLR)of blockchain consensus mechanisms,an essential protocols that maintain the integrity,reliability,and decentralization of distributed ledger networks.The aim is to comprehensively investigate prominent mechanisms’security features and vulnerabilities,emphasizing their security considerations,applications,challenges,and future directions.The existing literature offers valuable insights into various consensus mechanisms’strengths,limitations,and security vulnerabilities and their real-world applications.However,there remains a gap in synthesizing and analyzing this knowledge systematically.Addressing this gap would facilitate a structured approach to understanding consensus mechanisms’security and vulnerabilities comprehensively.The study adheres to Preferred Reporting Items for Systematic Reviews and Meta-Analyses(PRISMA)guidelines and computer science standards and reviewed 3749 research papers from 2016 to 2024,excluding grey literature,resulting in 290 articles for descriptive analysis.The research highlights an increased focus on blockchain consensus security,energy efficiency,and hybrid mechanisms within 60%of research papers post-2019,identifying gaps in scalability,privacy,and interoperability for future exploration.By synthesizing the existing research and identifying the key trends,this SLR contributes to advancing the understanding of blockchain consensus mechanisms’security and guiding future research and structured innovation in blockchain systems and applications.
文摘This is the fifth paper in a series on Time Dilation Cosmology, TDC. TDC is an eternal holographic model of the universe based on time dilation that ties astrophysics to quantum physics and resolves all the conundrums in astrophysics and serves as a model for the unified field. In the author’s previous four TDC papers, it was demonstrated that all gravitationally induced velocities are compensation for the apparent difference in the rates of time, “dRt”, due to mass/energy densities, and, vice-versa, in all force-induced velocities the dRt is compensation for the velocity, so the uniform evolution of the continuum at c is maintained at the invariant 1 s/s rate of time of the universe as a whole. These compensations make it impossible for an event to lag behind or get ahead of the evolving continuum. When the author did the first velocity formula derivations in “General Relativity: Effects in Time as Causation” [1], the author felt the explanations for the appearance of the 2spatial and the 3temporal acceleration factors in the formulas were correct, but poorly explained and incomplete. This paper is a proof of the temporal and spatial acceleration factors used in the time dilation-based velocity formula derivations in the Time Dilation Cosmology model.
基金supported by Canada First Research Excellence Fund,Medicine by Design(to CMM)。
文摘Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.
文摘There is an error in the name of the cell line in the abstract of the published paper“MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons”published on pages 2698-2707,Issue 12,Volume 19 of Neural Regeneration Research(Sharma et al.,2024),because of oversight during final proof checking.The correct description should be“human-GABA receptor A-α1/β2/γ2L human embryonic kidney(HEK)recombinant cell line.”The authors apologize for any inconvenience this correction may cause for readers and editors of Neural Regeneration Research.
基金supported by National Key R&D Program of China for Young Scientists:Cyberspace Endogenous Security Mechanisms and Evaluation Methods(No.2022YFB3102800).
文摘The security of information transmission and processing due to unknown vulnerabilities and backdoors in cyberspace is becoming increasingly problematic.However,there is a lack of effective theory to mathematically demonstrate the security of information transmission and processing under nonrandom noise(or vulnerability backdoor attack)conditions in cyberspace.This paper first proposes a security model for cyberspace information transmission and processing channels based on error correction coding theory.First,we analyze the fault tolerance and non-randomness problem of Dynamic Heterogeneous Redundancy(DHR)structured information transmission and processing channel under the condition of non-random noise or attacks.Secondly,we use a mathematical statistical method to demonstrate that for non-random noise(or attacks)on discrete memory channels,there exists a DHR-structured channel and coding scheme that enables the average system error probability to be arbitrarily small.Finally,to construct suitable coding and heterogeneous channels,we take Turbo code as an example and simulate the effects of different heterogeneity,redundancy,output vector length,verdict algorithm and dynamism on the system,which is an important guidance for theory and engineering practice.
