In order to evaluate all attack paths in a threat tree,based on threat modeling theory,a weight distribution algorithm of the root node in a threat tree is designed,which computes threat coefficients of leaf nodes in ...In order to evaluate all attack paths in a threat tree,based on threat modeling theory,a weight distribution algorithm of the root node in a threat tree is designed,which computes threat coefficients of leaf nodes in two ways including threat occurring possibility and the degree of damage.Besides,an algorithm of searching attack path was also obtained in accordence with its definition.Finally,an attack path evaluation system was implemented which can output the threat coefficients of the leaf nodes in a target threat tree,the weight distribution information,and the attack paths.An example threat tree is given to verify the effectiveness of the algorithms.展开更多
By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path ...By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path encryption. We present permutation code encryption which is based on path encryption. Now permutation code encryption is a patent of Chinese invention. In Permutation Code Encryption, we use a pseudo-random sequence of the keys to control the paths. The simulation result shows that for n-bit block the encryption strength is novel higher than 2^n and the algorithm can finish the encryption of one block in 7.5 ns, which is unrelated with the block length.展开更多
The object of this study is to propose a statistical model for predicting the Expected Path Length (expected number of steps the attacker will take, starting from the initial state to compromise the security goal—EPL...The object of this study is to propose a statistical model for predicting the Expected Path Length (expected number of steps the attacker will take, starting from the initial state to compromise the security goal—EPL) in a cyber-attack. The model we developed is based on utilizing vulnerability information along with having host centric attack graph. Utilizing the developed model, one can identify the interaction among the vulnerabilities and individual variables (risk factors) that drive the Expected Path Length. Gaining a better understanding of the relationship between vulnerabilities and their interactions can provide security administrators a better view and an understanding of their security status. In addition, we have also ranked the attributable variables and their contribution in estimating the subject length. Thus, one can utilize the ranking process to take precautions and actions to minimize Expected Path Length.展开更多
基金Supported by National Natural Science Foundation of China (No.90718023)National High-Tech Research and Development Program of China (No.2007AA01Z130)
文摘In order to evaluate all attack paths in a threat tree,based on threat modeling theory,a weight distribution algorithm of the root node in a threat tree is designed,which computes threat coefficients of leaf nodes in two ways including threat occurring possibility and the degree of damage.Besides,an algorithm of searching attack path was also obtained in accordence with its definition.Finally,an attack path evaluation system was implemented which can output the threat coefficients of the leaf nodes in a target threat tree,the weight distribution information,and the attack paths.An example threat tree is given to verify the effectiveness of the algorithms.
文摘By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path encryption. We present permutation code encryption which is based on path encryption. Now permutation code encryption is a patent of Chinese invention. In Permutation Code Encryption, we use a pseudo-random sequence of the keys to control the paths. The simulation result shows that for n-bit block the encryption strength is novel higher than 2^n and the algorithm can finish the encryption of one block in 7.5 ns, which is unrelated with the block length.
文摘The object of this study is to propose a statistical model for predicting the Expected Path Length (expected number of steps the attacker will take, starting from the initial state to compromise the security goal—EPL) in a cyber-attack. The model we developed is based on utilizing vulnerability information along with having host centric attack graph. Utilizing the developed model, one can identify the interaction among the vulnerabilities and individual variables (risk factors) that drive the Expected Path Length. Gaining a better understanding of the relationship between vulnerabilities and their interactions can provide security administrators a better view and an understanding of their security status. In addition, we have also ranked the attributable variables and their contribution in estimating the subject length. Thus, one can utilize the ranking process to take precautions and actions to minimize Expected Path Length.
