This paper considers the problem of the absent-minded driver who must choose between alternatives with different payoff under the conditions of imperfect recall and varying degrees of knowledge of the system. We show that agents with access to quantum resources, or with a quantum mechanical basis, can obtain superior performance as compared to classical agents. The paper also considers the problem of random tree representations of quantum decision processes. It is shown that in the general case where each node can have any branching probability value, a random tree can accurately represent the probabilities associated with an arbitrary quantum state.

Network coding has been shown to be an effective approach to improve the wireless system performance. However, many security issues impede its wide deployment in practice. Besides the well-studied pollution attacks, there is another severe threat, that of wormhole attacks, which undermines the performance gain of network coding. Since the underlying characteristics of network coding systems are distinctly different from traditional wireless networks, the impact of wormhole attacks and countermeasures are generally unknown. In this paper, we quantify wormholes' devastating harmful impact on network coding system performance through experiments. Then we propose DAWN, a Distributed detection Algorithm against Wormhole in wireless Network coding systems, by exploring the change of the flow directions of the innovative packets caused by wormholes. We rigorously prove that DAWN guarantees a good lower bound of successful detection rate. We perform analysis on the resistance of DAWN against collusion attacks. We find that the robustness depends on the node density in the network, and prove a necessary condition to achieve collusion-resistance. DAWN does not rely on any location information, global synchronization assumptions or special hardware/middleware. It is only based on the local information that can be obtained from regular network coding protocols, and thus does not introduce any overhead by extra test messages. Extensive experimental results have verified the effectiveness and the efficiency of DAWN.

Contemporary implementations of Quantum Key Distribution are based on BB84, first proposed in 1984, and commercially implemented for limited market applications in the early 2000s. A major limitation of BB84 is that it requires no more than a single photon per time slot. But no device can reliably generate single photons with guaranteed periodicity. In this paper, we address the practical issues of realizing quantum cryptography systems. In particular, we address the major shortcomings of quantum cryptography as practiced today - the limitation of requiring a single photon to be used in communication. This not only affects the security of the practical quantum cryptography systems, but also restricts the distance over which secure keys can be sent and their rate. Our approach is not limited to a single photon per time-slot thus making it possible to send keys faster and over longer distances. The paper discusses the innate nature of multi-photon communication protocols as a surrogate for quantum communication while giving it a cryptographic strength that would closely match that of a pure quantum communication system.

The Internet is currently being used by millions of users for web browsing, data storage, social networks, communications, VOIP, e-commerce, and other applications that are enabled by wireless networks, cloud computing, distributed systems, and cellphone networks. The architecture for these applications is not secure as shown by all the recent widely-publicized attacks. We propose a comprehensive security model for networking applications that includes new key distribution and management techniques and a realistic trust model.

This paper presents a k-out-of-n recursive information hiding scheme based on an n-ary tree data structure. In recursive hiding of information, the user encodes additional information in the shares of the secret, intended to be originally shared, without an expansion in the size of the latter. The proposed scheme has applications in secure distributed storage and information dispersal protocols. It may be used as a steganographic channel to transmit hidden information, which may be used for authentication and verification of shares and the reconstructed secret itself.

Abstract Optical burst switching (OBS) is the most promising optical switching technology for the future Internet, but it suffers from security vulnerabilities. In this paper, we propose to embed a security framework which incorporates the strengths of classical and the emerging quantum cryptography techniques in the native OBS network architecture, providing a means to make the future Internet secure from the ground up. The proposed embedded security architecture allows the best suited classical and quantum cryptography techniques to be deployed, making it possible to offer robust security. The security of quantum cryptography is based on the inherent randomness in quantum phenomena. The application of quantum techniques to optical networks is ideally suited to the problem because photons, which carry information in optical modality, are quantum objects. Since the well‐known BB84 quantum cryptography protocol is susceptible to siphoning attacks on the multiple photons emitted by practical sources, we propose to use a new 3‐stage quantum cryptography protocol which is immune to siphoning attacks, as it is based on random rotations of the polarization vector. This would allow multiple photons to be used in the quantum key exchange, and make it feasible to extend quantum cryptography services beyond trusted routers. Copyright © 2009 John Wiley & Sons, Ltd.

This paper presents a new protocol for Internet voting based on implicit data security. This protocol allows recasting of votes, which permits a change of mind by voters either during the time window over which polling is open or during a shorter period over which recasting is permitted [20]. The security of votes depends on multiple servers such that each vote is divided into partitions and these partitions are distributed among the servers, all of which need to be brought together to reconstruct the votes. Such a protocol has potential applications in bargaining and electronic commerce.

This paper presents several new properties of D sequences that have applications to encryption and error coding. It also considers the problem of joint encryption and error-correction coding and proposes a solution using D sequences. The encryption operation considered is equivalent to exponentiation, which forms the basis of several public-key schemes. An application of D sequences to generating events with specified probabilities is also presented.

This paper considers the problem of joint encryption and error-correction coding and proposes a solution using D-sequences, which are œdecimal' expansions of fractions. The encryption operation considered is equivalent to exponentiation which forms the basis of several public-key schemes. Several new results on D-sequences are also presented which make the applications to encryption and error coding possible.

This note reports the observation that the reciprocals of primes have an excess of zeros. For a binary representation only 2 percent of the cases appear to have more ones than zeros.

The computational-complexity approach and entropy using nominal frequencies lead to different measures to characterize patterns in finite binary sequences. These have been compared to a measure obtained on taking integral transforms of the sequences. The transforms considered in this paper are the Walsh and the discrete Legendre. Pattern characterization through integral transforms turns out to be intuitively satisfying. In particular, Walsh transform characterization appears natural for binary sequences as does the use of discrete Legendre transforms for more general (nonbinary) sequences.