This paper presents a comparative evaluation of possible encryption algorithms for use in a self-contained, ultra-secure router-to-router communication system, first proposed by El Rifai and Verma. The original proposal utilizes a discrete logarithm-based encryption solution, which will be compared in this paper to RSA, AES, and ECC encryption algorithms. RSA certificates are widely used within the industry but require a trusted key generation and distribution architecture. AES and ECC provide advantages in key length, processing requirements, and storage space, also maintaining an arbitrarily high level of security. This paper modifies each of the four algorithms for use within the self-contained router-to-router environment system and then compares them in terms of features offered, storage space and data transmission needed, encryption/decryption efficiency, and key generation requirements.

This paper presents the design and implementation of a new technology that can securely transfer symmetric encryption keys, e.g., Advanced Encryption Standard (AES) keys, over an optical fiber using a polarization-based channel. The integrity of the polarization channel against possible leakage of information is established. The polarization channel is used to transfer symmetric key information between the two parties using states of polarization (SoP) as the carrier of information and to detect presence of an intruder. Since the SoP is known to evolve during propagation along optical fiber, a correction matrix is applied to the received state to recover the original SoP. The information transferred over the corrected SoP forms the key for one or more channels on the fiber for symmetric encryption.

We present an efficient approach to text localization. We restrict our attention to the text localization and refer to our method as 'text search'. In particular, we pre-trained a text detection ConvNet which skip the region proposal process, and integrates bounding boxes and text confidence score into the output layer. Our approach achieved similar high precision with [1], and acceptable level of recall.

Super-resolution as an exciting application in image processing was studied widely in the literature. This paper presents new approaches to video super-resolution based on sparse coding and belief propagation. First, find candidate match pixels on multiple frames using sparse coding and belief propagation. Second, incorporate information from these candidate pixels with weights computed using the nonlocal-means method in the first approach or using the sparse coding and belief propagation method in the second approach. The effectiveness of the proposed methods is demonstrated for both synthetic and real video sequences in the experiment section. In addition, the experimental results show that our models are naturally robust in handling super-resolution on video sequences affected by scene motions and/or small camera motions.

Abstract This paper proposes a generalized multi‐stage multi‐photon protocol that uses arbitrary polarization states to securely communicate between a sender and a receiver. Because the polarization measurement of an arbitrarily polarized state results in altering the state in an irreversible way, any such measurement produces noise in the measured state. The proposed multi‐stage protocol exploits this phenomenon to provide quantum secure communication. This paper assesses the vulnerability of the multi‐stage protocol to photon number splitting attack and Trojan horse attack. In addition, it presents an upper bound on the number of photons that can be used per pulse to exchange information while maintaining quantum‐level security. Determination of such a bound is important for the multi‐stage protocol to operate in the multi‐photon domain while maintaining a quantum level of security. Furthermore, this paper proposes a key/message expansion scheme that provides another layer of security to the multi‐stage protocol. The multi‐stage protocol, can potentially provide higher data rates as well as longer communication distances. Copyright © 2015 John Wiley & Sons, Ltd.

This article presents two efficient cryptographic protocols, based on quantum entanglement, for secure exchange of secret keys. While the first protocol requires storage of entangled qubits, the second protocol has no storage requirements and presents a probabilistic model. We show that there is a tradeoff between security against eavesdropping and the efficiency of the protocol in terms of usable bits available for the secret key. This security parameter s can be varied by the communicating parties based on practical considerations.

This paper presents a model of integration of the Three-stage quantum cryptography protocol and its variants into the IEEE 802.11 wireless communication standard. The three-stage protocol is introduced during the quantum handshake as a replacement to the BB'84 protocol. Compared to the quantum handshake using BB'84, integrating the three-stage protocol offers several benefits such as enhanced data rates, fewer steps needed to establish the final key, longer distances, and increased number of photons that can be used during the transmission process. In addition, this paper presents a multi-agent software approach to implement the quantum handshake using the three-stage protocol.

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.

In this paper, we propose a system using video cameras to perform vehicle identification. We tackle this problem by reconstructing an input by using multiple linear regression models and compressed sensing, which provide new ways to deal with three crucial issues in vehicle identification, namely, feature extraction, online vehicle identification database buildup , and robustness to occlusions and misalignment. The results show the capability of the proposed approach.

In this paper, we propose an integrated Mobile WiMAX and free space optics (FSO) broadband access network where the FSO network is used to provide high capacity backhaul for the Mobile WiMAX front end. The integrated network extends the coverage of Mobile WiMAX networks to larger areas in applications where the fiber network is expensive and difficult to deploy. We present a unified EAP-based security framework, and we evaluate and compare the performance of EAP-TLS and EAP-TTLS for this integrated FSO-WiMAX access network. Furthermore, we evaluate the impact of the point-to-point FSO link in the integrated access network. Our measurement shows that compared to EAP-TLS, EAP-TTLS provides a more flexible, efficient, and secure way to protect the integrated FSO-WiMAX access network. Our experiment also demonstrates that the point-to-point FSO link does not degrade the performance of EAP authentication in the integrated network.

This study considers a multi-class network resource in a competitive market where each user endowed with an initial budget will purchase bandwidth from each class of the network resource to maximise its utility function. The authors use revenue as the utility function for the service provider, and enhance Kelly's utility function by including delay as the quality of service (QoS) parameter for users. A competitive equilibrium is reached when the total bandwidth is allocated, each user spends all its budget and the utility functions are independently and simultaneously maximised. The authors prove that such equilibriums always exist and, under fixed bandwidth supply for each class of service, the equilibrium is also unique. Furthermore, the authors discuss how to adjust the initial endowment of each user to meet his or her individual bandwidth constraint, either from constraint on the access network or the limitation of the user equipment. Under this bandwidth constraint condition, the proposed competitive equilibrium yields the price for each class of service, budget redistribution and bandwidth allocation among all users. The competitive market model presented provides a solution for pricing a multi-class network resource and allocating the resource that achieves both higher social utility and better individual satisfaction whereas maintaining the QoS of each class.

Abstract Passive optical networks (PONs) offer a popular broadband access solution allowing for high bandwidth and long transmission range to meet user fast evolving needs. However, in certain applications, PON deployment cannot reach the end user, because geographic restrictions make fiber installation non‐cost effective. Recently, hybrid fiber–wireless (FiWi) access networks have been proposed to combine the advantages of optical and wireless technologies and integrate them seamlessly. However, this integrated wired and wireless access network raises new security issues that need to be addressed. This paper reviews the architectures of currently proposed integrated access networks, proposes a new Worldwide Interoperability for Microwave Access (WiMAX) over Ethernet PON (EPON) architecture which achieves simplified and efficient system management. We present a unified security framework for the proposed architecture using Public Key Infrastructure (PKI). Through our analysis, we show that this security framework enhances the system security and realizes unified key management. Copyright © 2010 John Wiley & Sons, Ltd.

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.

Abstract This paper presents three new algorithms over a dual quantum channel to enhance the convergence speed of the key distribution process. The proposed algorithms effectively use a dual quantum channel between the communicating entities and, when combined with the proposed selection of the basis, improve the efficiency of the key distribution process as well as deter Eve. With the use of an initialization vector (IV), the proposed algorithm does not necessitate information exchange about the bases between Alice and Bob, thus removing the requirement of the availability of a two‐way conventional channel. Simultaneously, it allows the detection of the presence of Eve in real time. Copyright © 2008 John Wiley & Sons, Ltd.

Quantum key distribution has been a relatively recent addition to data security and integrity. It is based on advanced ideas that emanate from Quantum theory. Additionally, the optical network and the quantum photon provide a formidable basis for the application of quantum key distribution. We propose a new way of distributing encryption keys over quantum channels. The proposed method takes advantage of dual quantum channels between the communicating entities and complementary measuring bases in order to improve the efficiency with which the keys can be exchanged.

This paper identifies the security vulnerabilities in ethernet passive optical networks (EPONs), and proposes a RC4-based encryption and a key distribution scheme based on the Diffie-Hellman key exchange algorithm. The proposed method is expected to provide the benefits of a streaming cipher while at the same time using securely shared secret keys among the OLT and each ONU.

This paper presents a hybrid integration approach for heterogeneous heavy tailed traffic from multiple classes over a channel of known capacity, where the service times follow lognormal distribution. Using our hybrid integration approach, we formulate a procedure that can minimize delay while improving the channel utilization. We show that this approach yields lower delays than either the integrated or segregated approach described in published literature.

This correspondence presents expressions for the Mean Error-Free Interval in a packet-oriented data transmission system. In particular, the case of transmission through a random-error channel is studied, with some results also given for more general noisy channels.

This paper considers the problem of congestion in message-switched, or packet-switched, networks, which employ probabilistic routing schemes. A queueing model for the analysis of a local congestion control scheme is presented. Analytic study of the model shows that local congestion control with random routing is superior to similar control with deterministic routing for a particular example worked out here.

This concise paper extends the results of Pennotti and Schwartz by proposing a queueing model of a communication network with random routing and end-to-end congestion control. Using conventional performance criteria, the performance of this model is compared with that of a previously published model, where fixed routing was employed.

This concise paper presents a new network approach to delay minimization in a synchronous network. The delay minimization is achieved by controlling the demultiplexing frame with respect to the incoming frame in a master frame system.

This concise paper details the synchronization philosophy and instrumentalities adopted in The Dataroute [1], a TransCanada digital data network established in April 1973. The synchronization system discussed is a hierarchical master-slave system with a two-level hierarchy at locations physically distant from one another. A discussion of the alarm transmission in The Dataroute is also presented. Alarms in The Dataroute are displayed locally, and facilities are provided for their transmission to a regional center and a national center for real-time action as well as for management purposes, and report generation on demand.