Device-independent security of quantum cryptography against collective attacks

We present the optimal collective attack on a quantum key distribution protocol in the "device-independent" security scenario, where no assumptions are made about the way the quantum key distribution devices work or on what quantum system they operate. Our main result is a tight bound on the Holevo information between one of the authorized parties and the eavesdropper, as a function of the amount of violation of a Bell-type inequality.     

Optimization of robustness of network controllability against malicious attacks

As the controllability of complex networks has attracted much attention recently, how to design and optimize the robustness of network controllability has become a common and urgent problem in the engineering field. In this work, we propose a method that modifies any given network with strict structural perturbation to effectively enhance its robustness against malicious attacks, called dynamic optimization of controllability. Unlike other structural perturbations, the strict perturbation only swaps the links and keeps the in- and out-degree unchanged. A series of extensive experiments show that the robustness of controllability and connectivity can be improved dramatically. Furthermore, the effectiveness of our method is explained from the views of underlying structure. The analysis results indicate that the optimization algorithm makes networks more homogenous and assortative.     

Continuous-variable quantum cryptography is secure against non-Gaussian attacks

A general study of arbitrary finite-size coherent attacks against continuous-variable quantum cryptographic schemes is presented. It is shown that, if the size of the blocks that can be coherently attacked by an eavesdropper is fixed and much smaller than the key size, then the optimal attack for a given signal-to-noise ratio in the transmission line is an individual Gaussian attack. Consequently, non-Gaussian coherent attacks do not need to be considered in the security analysis of such quantum cryptosystems.     

Anomalous transport in scale-free networks

To study transport properties of scale-free and Erdos-Rényi networks, we analyze the conductance G between two arbitrarily chosen nodes of random scale-free networks with degree distribution P(k)-k(-lambda) in which all links have unit resistance. We predict a broad range of values of G, with a power-law tail distribution phi(SF)(G)-G(-g(G)), where g(G)=2lambda-1, and confirm our predictions by simulations. The power-law tail in phi(SF)(G) leads to large values of G, signaling better transport in scale-free networks compared to Erdos-Rényi networks where the tail of the conductivity distribution decays exponentially. Based on a simple physical "transport backbone" picture we show that the conductances of scale-free and Erdos-Rényi networks are well approximated by ck(A)k(B)/(k(A)+k(B)) for any pair of nodes A and B with degrees k(A) and k(B), where c emerges as the main parameter characterizing network transport.     

Modeling sediment transport in river networks

A dynamical model is proposed to study sediment transport in river networks. A river can be divided into segments by the injection of branch streams of higher rank. The model is based on the fact that in a real river, the sediment-carrying capability of the stream in the ith segment may be modulated by the undergone state, which may be erosion or sedimentation, of the i−1th and ith segments, and also influenced by that of the ith injecting branch of higher rank. We select a database about the upper-middle reach of the Yellow River in the lower-water season to test the model. The result shows that the data, produced by averaging the erosion or sedimentation over the preceding transient process, are in good agreement with the observed average in a month. With this model, the steady state after transience can be predicted, and it indicates a scaling law that the quantity of erosion or sedimentation exponentially depends on the number of the segments along the reach of the channel. Our investigation suggests that fluctuation of the stream flow due to random rainfall will prevent this steady state from occurring. This is owing to the phenomenon that the varying trend of the quantity of erosion or sedimentation is opposite to that of sediment-carrying capability of the stream.     

Wavelength conversion in optical transport networks

The introduction of optical technology in the path layer of a transport network is analyzed; in particular, the impact of all-optical wavelength conversion is examined. Two basic optical cross-connect schemes based on space switching and on wave-length switching, respectively, and two types of wavelength converters are considered. The wavelength converters are, respectively, based on four-wave miring (FWM) in semiconductor optical amplifiers (SOAs) and on cross-phase modulation (XPM) obtained by two SOAs put in an interferometric configuration. An analysis of transmission performances of optical transport networks employing both types of wavelength conversion and both the node architectures is reported. The performances are evaluated by means of a system modeling that facilitates considering physical phenomena occurring during transmission and all the important transmission impairments. The analysis reveals that both the types of converters can be employed with different features and limitations, according to the considered network and switching architecture.     

Observation of transport in mesoscopic honeycomb-shaped networks

An electronic transport was observed in honeycomb-shaped mesoscopic (submicron) networks at liquid helium temperature. These networks were manufactured by the reactive ion etching of highly (nearly degenerated) and moderately doped n-GaAs epilayers through the initially structured, by self-organised patterning, polymer masks. The free electron transport was observed in the networks of thin, highly doped, n-GaAs epilayer. The detected multiple switching on theI–Vcharacteristics was explained in the framework of the model of a dynamic random resistor network. The existence of the patterned part of the thick, moderately doped, n-GaAs epilayer was the reason for the increase of the compensation ratio, the ionization energy and, as a result, the threshold voltage of the impact ionization of the shallow donor impurity level in the bulk of the epilayer.     

Optimization of transport protocols in complex networks

In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of complex networks. In order to avoid nodes overloading, the new algorithm is derived on the basis of generalized betweenness centrality which gives an estimate of traffic handled by the node for a route set. Since the nodes with large betweenness centrality are more susceptible to traffic congestion, the traffic can be improved, as our strategy, by redistributing traffic load from nodes with large betweenness centrality to nodes with small betweenness centrality in the proceeding of computing collective routing table. Particularly, depending on a parameter that controls the optimization scale, the new routing can not only enlarge traffic capacity of networks more, but also enhance traffic efficiency with smaller average path length. Comparing results of previous routing strategies, it is shown that the present improved routing performs more effectively.     

Robustness of networks against cascading failures

Inspired by other related works, this paper proposes a non-linear load-capacity model against cascading failures, which is more suitable for real networks. The simulation was executed on the B-A scale-free network, E-R random network, Internet AS level network, and the power grid of the western United States. The results show that the model is feasible and effective. By studying the relationship between network cost and robustness, we find that the model can defend against cascading failures better and requires a lower investment cost when higher robustness is required.     

Security of decoy states QKD with finite resources against collective attacks

The number of transmitted signals in practical quantum key distribution (QKD) protocol is always finite. We discuss the security of decoy states QKD protocol with finite resources by considering the statistical fluctuation for the yield and error rate of the quantum state in different sources of pulses (signal sources and decoy sources). The number of exchanged quantum signals vs positive key generation rate is given with experiment results.     

Electronic transport in phosphorus-doped silicon nanocrystal networks

We have investigated the role of doping and paramagnetic states on the electronic transport of networks assembled from freestanding Si nanocrystals (Si-NCs). Electrically detected magnetic resonance (EDMR) studies on Si-NCs films, which show a strong increase of conductivity with doping of individual Si-NCs, reveal that P donors and Si dangling bonds contribute to dark conductivity via spin-dependent hopping, whereas in photoconductivity, these states act as spin-dependent recombination centers of photogenerated electrons and holes. Comparison between EDMR and conventional electron paramagnetic resonance shows that different subsets of P-doped nanocrystals contribute to the different transport processes.     

A game theory model of urban public traffic networks

We have studied urban public traffic networks from the viewpoint of complex networks and game theory. Firstly, we have empirically investigated an urban public traffic network in Beijing in 2003, and obtained its statistical properties. Then a simplified game theory model is proposed for simulating the evolution of the traffic network. The basic idea is that three network manipulators, passengers, an urban public traffic company, and a government traffic management agency, play games in a network evolution process. Each manipulator tries to build the traffic lines to magnify its “benefit”. Simulation results show a good qualitative agreement with the empirical results.     

Capacity limits of information transport in fiber-optic networks

The instantaneous optical Kerr effect in optical fibers is a nonlinear phenomenon that can impose limits on the ability of fiber-optic communication systems to transport information. We present here a conservative estimate of the "fiber channel" capacity in an optically routed network. We show that the fiber capacity per unit bandwidth for a given distance significantly exceeds current record experimental demonstrations.     

Security of a practical semi-device-independent quantum key distribution protocol against collective attacks

Similar to device-independent quantum key distribution(DI-QKD), semi-device-independent quantum key distribution(SDI-QKD) provides secure key distribution without any assumptions about the internal workings of the QKD devices.The only assumption is that the dimension of the Hilbert space is bounded. But SDI-QKD can be implemented in a oneway prepare-and-measure configuration without entanglement compared with DI-QKD. We propose a practical SDI-QKD protocol with four preparation states and three measurement bases by considering the maximal violation of dimension witnesses and specific processes of a QKD protocol. Moreover, we prove the security of the SDI-QKD protocol against collective attacks based on the min-entropy and dimension witnesses. We also show a comparison of the secret key rate between the SDI-QKD protocol and the standard QKD.     

Stability analysis of peer-to-peer networks against churn

Users of the peer-to-peer system join and leave the network randomly, which makes the overlay network dynamic and unstable in nature. In this paper, we propose an analytical framework to assess the robustness of p2p networks in the face of user churn. We model the peer churn through degree-independent as well as degree-dependent node failure. Lately, superpeer networks are becoming the most widely used topology among the p2p networks. Therefore, we perform the stability analysis of superpeer networks as a case study. We validate the analytically derived results with the help of simulation.      

Novel hybrid mitigation strategy for improving the resiliency of hierarchical networks subjected to attacks

This paper studies the resiliency of hierarchical networks when subjected to random errors, static attacks, and cascade attacks. The performance is compared with existing Erdös–Rényi (ER) random networks and Barabasi and Albert (BA) scale-free networks using global efficiency as the common performance metric. The results show that critical infrastructures modeled as hierarchical networks are intrinsically efficient and are resilient to random errors, however they are more vulnerable to targeted attacks than scale-free networks. Based on the response dynamics to different attack models, we propose a novel hybrid mitigation strategy that combines discrete levels of critical node reinforcement with additional edge augmentation. The proposed modified topology takes advantage of the high initial efficiency of the hierarchical network while also making it resilient to attacks. Experimental results show that when the level of damage inflicted on a critical node is low, the node reinforcement strategy is more effective, and as the level of damage increases, the additional edge augmentation is highly effective in maintaining the overall network resiliency.     

Epidemic dynamics behavior in some bus transport networks

We abstract bus transport networks (BTNs) to complex networks using the Space P approach. First, we select three actual BTNs in three major cities in China, namely, Beijing, Shanghai and Hangzhou. Using the SIS model, we simulate and study the epidemic spreading in the three BTNs. We obtain the density of infected vertices varying with time and the stationary density of infected vertices varying with infection rate. Second, we simulate and study the epidemic spreading in a recently introduced BTN evolution model, the network properties of which correspond well with those of actual BTNs. Third, we use mean-field theory to analyze the epidemic dynamics behavior of the BTN evolution model and obtain the theoretical epidemic threshold of this model. The theoretical value agrees well with the simulation results. Based on the work in this paper, we provide the following possible forecasts for epidemic dynamics in actual BTNs. An actual BTN should have a finite positive epidemic threshold. If the effective infection rate is above this threshold, the epidemic spread in the network and the density of infected vertices finally stabilizes in a balanced state. Below this threshold, the number of infected vertices decays exponentially fast and the epidemic cannot spread on a large scale.     

Universal relation for transport in non-sparse complex networks

Transport properties of a complex network can be reflected by the two-point resistance between any pair of two nodes. We systematically investigate a variety of typical complex networks encountered in nature and technology, in which we assume each link has unit resistance, and we find for non-sparse network connections a universal relation exists that the two-point resistance is equal to the sum of the inverse degree of two nodes up to a constant. We interpret our observations by the localization property of the network's Laplacian eigenvectors. The findings in this work can possibly be applied to probe transport properties of general non-sparse complex networks.