Geographical constraints to range-based attacks on links in complex networks

In this paper, we studied range-based attacks on links in geographically constrained scale-free networks and found that there is a continuous switching of roles of short-and long-range attacks on links when tuning the geographical constraint strength. Our results demonstrate that the geography has a significant impact on the network efficiency and security; thus one can adjust the geographical structure to optimize the robustness and the efficiency of the networks. We introduce a measurement of the impact of links on the efficiency of the network, and an effective attacking strategy is suggested

Relaxation of selective constraints on avian mitochondrial DNA following the degeneration of flight ability

The evolution of flight is the most important feature of birds, and this ability has helped them become one of the most successful groups of vertebrates. However, some species have independently lost their ability to fly. The degeneration of flight abilit

Variation patterns of the mitochondrial 16S rRNA gene with secondary structure constraints and their application to phylogeny of cyprinine fishes (Teleostei : Cypriniformes)

The mitochondrial 16S ribosomal RNA (rRNA) gene sequences from 93 cyprinid fishes were examined to reconstruct the phylogenetic relationships within the diverse and economically important subfamily Cyprininae. Within the subfamily a biased nucleotide composition (A > T, C > G) was observed in the loop regions of the gene, and in stem regions apparent selective pressures of base pairing showed a bias in favor of G over C and T over A. The bias may be associated with transition-transversion bias. Rates of nucleotide substitution were lower in stems than in loops. Analysis of compensatory substitutions across these taxa demonstrates 68% covariation in the gene and a logical weighting factor to account for dependence in mutations for phylogenetic inference should be 0.66. Comparisons of varied stem-loop weighting schemes indicate that the down-weightings for stem regions could improve the phylogenetic analysis and the degree of non-independence of stem substitutions was not as important as expected. Bayesian inference under four models of nucleotide substitution indicated that likelihood-based phylogenetic analyses were more effective in improving the phylogenetic performance than was weighted parsimony analysis. In Bayesian analyses, the resolution of phylogenies under the 16-state models for paired regions, incorporating GTR + G + I models for unpaired regions was better than those under other models. The subfamily Cyprininae was resolved as a monophyletic group, as well as tribe Labein and several genera. However, the monophyly of the currently recognized tribes, such as Schizothoracin, Barbin, Cyprinion + Onychostoma lineages, and some genera was rejected. Furthermore, comparisons of the parsimony and Bayesian analyses and results of variable length bootstrap analysis indicates that the mitochondrial 16S rRNA gene should contain important character variation to recover well-supported phylogeny of cyprinid taxa whose divergences occurred within the recent 8 MY, but could not provide resolution power for deep phylogenies spanning 10-19 MYA. (c) 2008 Published by Elsevier Inc.

Practical Evaluation of Security against Generalized Interpolation Attack

Interpolation attack was presented by Jakobsen and Knudsen at FSE'97. Interpolation attack is effective against ciphers that have a certain algebraic structure like the PURE cipher which is a prototype cipher, but it is difficult to apply the attack to real-world ciphers. This difficulty is due to the difficulty of deriving a low degree polynomial relation between ciphertexts and plaintexts. In other words, it is difficult to evaluate the security against interpolation attack. This paper generalizes the interpolation attack. The generalization makes easier to evaluate the security against interpolation attack. We call the generalized interpolation attack linear sum attack. We present an algorithm that evaluates the security of byte-oriented ciphers against linear sum attack. Moreover, we show the relationship between linear sum attack and higher order differential attack. In addition, we show the security of CRYPTON, E2, and RIJNDAEL against linear sum attack using the algorithm.

an improved smart card based password authentication scheme with provable security

Password authentication has been adopted as one of the most commonly used solutions in network environment to protect resources from unauthorized access. Recently, Lee–Kim–Yoo [S.W. Lee, H.S. Kim, K.Y. Yoo, Improvement of Chien et al.'s remote user authentication scheme using smart cards, Computer Standards & Interfaces 27 (2) (2005) 181–183] and Lee-Chiu [N.Y. Lee, Y.C. Chiu, Improved remote authentication scheme with smart card, Computer Standards & Interfaces 27 (2) (2005) 177–180] respectively proposed a smart card based password authentication scheme. We show that these two schemes are both subject to forgery attacks provided that the information stored in the smart card is disclosed by the adversary. We also propose an improved scheme with formal security proof.

cryptanalysis of the end-to-end security protocol for mobile communications with end-user identification/authentication

IEEE Computer Society

delegation model for periodicity constraints-based dac

Xidian University