We introduce two novel techniques, random noise on unused channels and varying the inter-code phases on realistic framing repetition, to obtain an OCDM-based encryption scheme for which we can prove desirable security guarantees.
As data rates outpace the capabilities of electronic encryption schemes, photonic layer security may fill the gap in providing a communication security solution at high data rates. In this article we review and highlight the advantages of our proposed optical code-division multiplexed (OCDM)-based photonic layer security (PLS) system based on high-resolution control of the optical phase of tightly spaced phase locked laser lines. Such a PLS system is scaleable to 100 Gb/s and provides a protocol independent security solution. We review the use of high-resolution control of the optical phase of mode-locked laser frequency combs as an enabling technology for a new class of OCDM systems. A network based on such systems is compatible with and can have comparable spectral efficiency to existing DWDM networks. Through inverse multiplexing of 10 Gb/s tributaries, we have already demonstrated optical transmission of a 40 Gb/s aggregate OCDM signal over 400 km. Such a PLS solution is achieved through shared phase scrambling of the individual OCDM codes assigned to each of the tributaries using an integrated micro-ring resonator-based phase coder/scrambler. The confidentiality of OCDM-based PLS is robust against exhaustive, known plain text, and archival/forensic attacks, and can complement digital encryption operating at higher layers. Moreover, the integrity of the PLS solution is ensured through the inherent coupling to confidentiality, since knowledge of the key is needed in order to easily alter the transmitted data stream without introducing observable errors. This system can leverage advances in optical integration to support new applications where electronic encryption is impractical because of space, weight, power, availability, and cost requirements. Such applications range from timely security support for the emerging 100 GbE standards to all-optical multilevel security offered through the compatibility of PLS with transparent DWDM networks.
We propose and experimentally demonstrate a transparent optical-code-division multiplexing (OCDM) overlay public dense wavelength-division multiplexing (DWDM) network architecture enabled by a passive spectral notch filter for extracting and detecting a secure OCDM signal, which employs a time domain spectral phase encoding/decoding scheme that can simultaneously generate differential-phase-shift-keying (DPSK) data and optical code patterns using only a single phase modulator. The time domain encoded OCDM signal has been scrambled bit-by-bit by a prime hopping pattern and concealed in the public DWDM channels to significantly improve the OCDM channel security. The effect of optical code patterns, the channel number, and bandwidth of the spectral notch filters on the system performance has been theoretically simulated and experimentally validated. In the experiment, error-free transmission of a 2.5-Gb/s time domain spectral phase encoded DPSK–OCDM signal with three 8-chip, 20-Gchip/s optical codes and a scrambled code pattern in the transparent OCDM overlay two-channel 10-Gb/s DWDM network has been successfully demonstrated.
Authenticated key exchange protocols are ubiquitous in modern-day life. They are used to secure numerous types of data exchange, ranging from online banking to instant messaging conversations. In this thesis, we extend the state of the art for authenticated key exchange security, following the three themes of realistic, strong and provable. First, we tackle the theme of provable security. We develop generic techniques, applicable to a wide range of security models, to assist in proofs of security of cryptographic schemes. Specifically, a "game hopping" proof is a powerful technique to prove strong statements about the security of a protocol. However, the proof technique often involves esoteric and repetitive steps. We demystify the methodology and prove generic theorems to reduce the length and complexity of a wide class of game hopping proofs. Next, we use this new framework to analyse strong and previously unstudied formal security guarantees of authenticated key exchange protocols. These protocols are able to achieve strong security guarantees because they share and update state across sessions. Using our framework, we are able to push the state of the art by defying the folklore of what was previously thought provable of authenticated key exchange protocols. Specifically, it was previously thought that no protocol can achieve a security guarantee about communication with a peer if the peer was already fully compromised. We show that this is not true by formally defining a new concept, which we name post-compromise security. We capture an intuitive "self-healing" property of protocols. We then construct and formally prove protocols can achieve this strong security notion. Finally, we leverage all of this work to analyse realistic protocols. Signal, which is used to encrypt messages in WhatsApp, Facebook Messenger and Google Allo amongst others, is one such protocol we consider. Despite being used by billions of people, Signal was completely unstudied in the academic literature prior to this work. Two reasons for this were that Signal had no documentation at the time and it did not fit into existing models: it shares state across sessions and has over ten different types of key, most of which continually update. Despite its complexity, we are able to use the other work in this thesis to give the first ever analysis and proof of security of Signal. Overall, this thesis aims to bridge the gap between theory and practice in the current state of the art of authenticated key exchange protocols.