Related papers: Implementation and transition to post-quantum cryp…
Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have…
Quantum Internet in a Nutshell (QI-Nutshell) connects the fields of quantum communication and quantum computing by emulating quantum communication protocols on currently available ion-trap quantum computers. We demonstrate emulations of QKD…
Quantum computers are expected to break today's public key cryptography within a few decades. New cryptosystems are being designed and standardised for the post-quantum era, and a significant proportion of these rely on the hardness of…
Secret sharing is a fundamental primitive in cryptography, and it can be achieved even with perfect security. However, the distribution of shares requires computational assumptions, which can compromise the overall security of the protocol.…
A semi-quantum key distribution (SQKD) protocol allows a quantum user and a limited "classical" user to establish a shared secret key secure against an all-powerful adversary. In this work, we present a new SQKD protocol where the quantum…
We developed a modified version of a conventional (BB84) quantum key distribution protocol that can be understood and implemented by students at a pre-university level. We intentionally introduce a subtle but critical simplification to the…
Progress in the development of techniques for the construction of multiuser quantum communications networks is reviewed in light of the plans for an EU quantum communications infrastructure (EU QCI). Quantum key distribution networks may be…
We demonstrate how adversaries with unbounded computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously. This authentication code, featuring low key…
We here present the rate analysis and a proof of principle realization of a device-independent quantum key distribution (QKD) protocol requiring the lowest detection efficiency necessary to achieve a secure key compared to…
Cryptographic key exchange protocols traditionally rely on computational conjectures such as the hardness of prime factorisation to provide security against eavesdropping attacks. Remarkably, quantum key distribution protocols like the one…
Public key infrastructures (PKIs) are one of the main building blocks for securing communications over the Internet. Currently, PKIs are under the control of centralized authorities, which is problematic as evidenced by numerous incidents…
Cryptography promises four information security objectives, namely, confidentiality, integrity, authenticity, and non-repudiation, to support trillions of transactions annually in the digital economy. Efficient digital signatures, ensuring…
Public-key cryptography algorithms have evolved towards increasing computational complexity to hide desired messages, which is accelerating with the development of the Internet and quantum computing. This paper introduces a novel public-key…
Side-channel attacks are an unpredictable risk factor in cryptography. Therefore, continuous observations of physical leakages are essential to minimise vulnerabilities associated with cryptographic functions. Lightweight cryptography is a…
Advances in quantum computing make Shor's algorithm for factorising numbers ever more tractable. This threatens the security of any cryptographic system which often relies on the difficulty of factorisation. It also threatens methods based…
Semi-quantum communication, a model introduced in 2007 by M. Boyer, D. Kenigsberg, and T. Mor (PRL 99 140501), involves the use of fully-quantum users and semi-quantum, or "classical" users. These restricted users are only allowed to…
Networks such as the Internet are essential for our connected world. Quantum computing poses a threat to this heterogeneous infrastructure since it threatens fundamental security mechanisms. Therefore, a migration to…
In this paper we present a new primitive for a key exchange protocol based on multivariate non-commutative polynomial rings, analogous to the classic Diffie-Hellman method. Our technique extends the proposed scheme of Boucher et al. from…
The study of quantum cryptography and quantum non-locality have traditionnally been based on two-level quantum systems (qubits). In this paper we consider a generalisation of Ekert's cryptographic protocol [Ekert] where qubits are replaced…
We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…