Quantum cryptography without switching

We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous schemes that only make single quadrature measurements. It also offers the further advantage of simplicity compared to all previous protocols which, to date, have relied on switching.

Measuring a photonic qubit without destroying it

Measuring the polarization of a single photon typically results in its destruction. We propose, demonstrate, and completely characterize a quantum nondemolition (QND) scheme for realizing such a measurement nondestructively. This scheme uses only linear optics and photodetection of ancillary modes to induce a strong nonlinearity at the single-photon level, nondeterministically. We vary this QND measurement continuously into the weak regime and use it to perform a nondestructive test of complementarity in quantum mechanics. Our scheme realizes the most advanced general measurement of a qubit to date: it is nondestructive, can be made in any basis, and with arbitrary strength.

Foundations of quantum technology

Recent progress in fabrication and control of single quantum systems presage a nascent technology based on quantum principles. We review these principles in the context of specific examples including: quantum dots, quantum electromechanical systems, quantum communication and quantum computation.

Coherent-state quantum key distribution without random basis switching

The random switching of measurement bases is commonly assumed to be a necessary step of quantum key distribution protocols. In this paper we present a no-switching protocol and show that switching is not required for coherent-state continuous-variable quantum key distribution. Further, this protocol achieves higher information rates and a simpler experimental setup compared to previous protocols that rely on switching. We propose an optimal eavesdropping attack against this protocol, assuming individual Gaussian attacks. Finally, we investigate and compare the no-switching protocol applied to the original Bennett-Brassard 1984 scheme.

Continuous variable tripartite entanglement from twin nonlinearities

In this work, we analyse and compare the continuous variable tripartite entanglement available from the use of two concurrent or cascaded X (2) nonlinearities. We examine both idealized travelling-wave models and more experimentally realistic intracavity models, showing that tripartite entangled outputs are readily producible. These may be a useful resource for applications such as quantum cryptography and teleportation.

Context-enhanced authentication for infrastructureless network environments

Infrastructureless networks are becoming more popular with the increased prevalence of wireless networking technology. A significant challenge faced by these infrastructureless networks is that of providing security. In this paper we examine the issue of authentication, a fundamental component of most security approaches, and show how it can be performed despite an absence of trusted infrastructure and limited or no existing trust relationship between network nodes. Our approach enables nodes to authenticate using a combination of contextual information, harvested from the environment, and traditional authentication factors (such as public key cryptography). Underlying our solution is a generic threshold signature scheme that enables distributed generation of digital certificates.

Formal verification of type flaw attacks in security protocols

Security protocols are often modelled at a high level of abstraction, potentially overlooking implementation-dependent vulnerabilities. Here we use the Z specification language's rich set of data structures to formally model potentially ambiguous messages that may be exploited in a 'type flaw' attack. We then show how to formally verify whether or not such an attack is actually possible in a particular protocol using Z's schema calculus.