Considering the secure authentication problem for equipment support information network,a clustering method based on the business information flow is proposed. Based on the proposed method,a cluster-based distributed ...Considering the secure authentication problem for equipment support information network,a clustering method based on the business information flow is proposed. Based on the proposed method,a cluster-based distributed authentication mechanism and an optimal design method for distributed certificate authority( CA)are designed. Compared with some conventional clustering methods for network,the proposed clustering method considers the business information flow of the network and the task of the network nodes,which can decrease the communication spending between the clusters and improve the network efficiency effectively. The identity authentication protocols between the nodes in the same cluster and in different clusters are designed. From the perspective of the security of network and the availability of distributed authentication service,the definition of the secure service success rate of distributed CA is given and it is taken as the aim of the optimal design for distributed CA. The efficiency of providing the distributed certificate service successfully by the distributed CA is taken as the constraint condition of the optimal design for distributed CA. The determination method for the optimal value of the threshold is investigated. The proposed method can provide references for the optimal design for distributed CA.展开更多
In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the s...In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.展开更多
In this in-depth exploration, I delve into the complex implications and costs of cybersecurity breaches. Venturing beyond just the immediate repercussions, the research unearths both the overt and concealed long-term ...In this in-depth exploration, I delve into the complex implications and costs of cybersecurity breaches. Venturing beyond just the immediate repercussions, the research unearths both the overt and concealed long-term consequences that businesses encounter. This study integrates findings from various research, including quantitative reports, drawing upon real-world incidents faced by both small and large enterprises. This investigation emphasizes the profound intangible costs, such as trade name devaluation and potential damage to brand reputation, which can persist long after the breach. By collating insights from industry experts and a myriad of research, the study provides a comprehensive perspective on the profound, multi-dimensional impacts of cybersecurity incidents. The overarching aim is to underscore the often-underestimated scope and depth of these breaches, emphasizing the entire timeline post-incident and the urgent need for fortified preventative and reactive measures in the digital domain.展开更多
This paper presents the lower bounds and upper bounds for the mean value and variance of distance distribution of non-linear codes in GF(q). By presenting several examples, it is shown that these bounds could be achie...This paper presents the lower bounds and upper bounds for the mean value and variance of distance distribution of non-linear codes in GF(q). By presenting several examples, it is shown that these bounds could be achieved.展开更多
The error patterns of a wireless channel can be represented by a binary sequence of ones(burst) and zeros(run),which is referred to as a trace.Recent surveys have shown that the run length distribution of a wireless c...The error patterns of a wireless channel can be represented by a binary sequence of ones(burst) and zeros(run),which is referred to as a trace.Recent surveys have shown that the run length distribution of a wireless channel is an intrinsically heavy-tailed distribution.Analytical models to characterize such features have to deal with the trade-off between complexity and accuracy.In this paper,we use an independent but not identically distributed(inid) stochastic process to characterize such channel behavior and show how to parameterize the inid bit error model on the basis of a trace.The proposed model has merely two parameters both having intuitive meanings and can be easily figured out from a trace.Compared with chaotic maps,the inid bit error model is simple for practical use but can still be deprived from heavy-tailed distribution in theory.Simulation results demonstrate that the inid model can match the trace,but with fewer parameters.We then propose an improvement on the inid model to capture the 'bursty' nature of channel errors,described by burst length distribution.Our theoretical analysis is supported by an experimental evaluation.展开更多
基金National Natural Science Foundation of China(No.61271152)Natural Science Foundation of Hebei Province,China(No.F2012506008)the Original Innovation Foundation of Ordnance Engineering College,China(No.YSCX0903)
文摘Considering the secure authentication problem for equipment support information network,a clustering method based on the business information flow is proposed. Based on the proposed method,a cluster-based distributed authentication mechanism and an optimal design method for distributed certificate authority( CA)are designed. Compared with some conventional clustering methods for network,the proposed clustering method considers the business information flow of the network and the task of the network nodes,which can decrease the communication spending between the clusters and improve the network efficiency effectively. The identity authentication protocols between the nodes in the same cluster and in different clusters are designed. From the perspective of the security of network and the availability of distributed authentication service,the definition of the secure service success rate of distributed CA is given and it is taken as the aim of the optimal design for distributed CA. The efficiency of providing the distributed certificate service successfully by the distributed CA is taken as the constraint condition of the optimal design for distributed CA. The determination method for the optimal value of the threshold is investigated. The proposed method can provide references for the optimal design for distributed CA.
基金the National Natural Science Foundation of China (Grant Nos. 61972413, 61901525, and 62002385)the National Key R&D Program of China (Grant No. 2021YFB3100100)RGC under Grant No. N HKUST619/17 from Hong Kong, China。
文摘In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.
文摘In this in-depth exploration, I delve into the complex implications and costs of cybersecurity breaches. Venturing beyond just the immediate repercussions, the research unearths both the overt and concealed long-term consequences that businesses encounter. This study integrates findings from various research, including quantitative reports, drawing upon real-world incidents faced by both small and large enterprises. This investigation emphasizes the profound intangible costs, such as trade name devaluation and potential damage to brand reputation, which can persist long after the breach. By collating insights from industry experts and a myriad of research, the study provides a comprehensive perspective on the profound, multi-dimensional impacts of cybersecurity incidents. The overarching aim is to underscore the often-underestimated scope and depth of these breaches, emphasizing the entire timeline post-incident and the urgent need for fortified preventative and reactive measures in the digital domain.
文摘This paper presents the lower bounds and upper bounds for the mean value and variance of distance distribution of non-linear codes in GF(q). By presenting several examples, it is shown that these bounds could be achieved.
基金Project supported by the National Natural Science Foundationof China (Nos. 61103010,61103190,and 60803100)the National Basic Research Program (973) of China (No. 2012CB933500)the High-Tech R&D Program (863) of China (No.2012AA011001)
文摘The error patterns of a wireless channel can be represented by a binary sequence of ones(burst) and zeros(run),which is referred to as a trace.Recent surveys have shown that the run length distribution of a wireless channel is an intrinsically heavy-tailed distribution.Analytical models to characterize such features have to deal with the trade-off between complexity and accuracy.In this paper,we use an independent but not identically distributed(inid) stochastic process to characterize such channel behavior and show how to parameterize the inid bit error model on the basis of a trace.The proposed model has merely two parameters both having intuitive meanings and can be easily figured out from a trace.Compared with chaotic maps,the inid bit error model is simple for practical use but can still be deprived from heavy-tailed distribution in theory.Simulation results demonstrate that the inid model can match the trace,but with fewer parameters.We then propose an improvement on the inid model to capture the 'bursty' nature of channel errors,described by burst length distribution.Our theoretical analysis is supported by an experimental evaluation.
