Electronic Notes in Theoretical Computer Science

Classical Knowledge for Quantum Cryptographic Reasoning

Vincent Danos A, Ellie D’Hondt

Published Nov 1, 2008• 3 citations

Abstract

We prove that quantum key distribution is secure against several types of attacks within the framework of classical knowledge knowledge for quantum systems, a formal model which was developed in [D'Hondt, E. and P. Panangaden, Reasoning about quantum knowledge, in: Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 3821, 2005, p. 0544c (to appear), quant-ph/0507176]. In particular we rephrase security as a logical property and use meta-logic reasoning on the finite state machine corresponding to the quantum key distribution protocol. While these security issues have been studied before, it is the logical-based approach that is original here.

DOI: 10.1016/j.entcs.2008.10.026

Related papers

Classical knowledge for quantum security (extended abstract)

Ellie D’Hondt, Mehrnoosh Sadrzadeh

We propose a decision procedure for analysing security of quantum cryptographic protocols, combining a classical algebraic rewrite system for knowledge with an operational semantics for quantum distributed computing. As a test case, we use our procedure to reason about security properties of a recently developed quantum secret sharing protocol that uses graph states. We analyze three different scenarios based on the safety assumptions of the classical and quantum channels and discover the path of an attack in the presence of an adversary. The epistemic analysis that leads to this and similar types of attacks is purely based on our classical notion of knowledge.

Jan 1, 20080 citations

Classical Knowledge for Quantum Security

Ellie D’Hondt, Mehrnoosh Sadrzadeh

We propose a decision procedure for analysing security of quantum cryptographic protocols, combining an algebraic logic rewrite system with an operational semantics for quantum distributed computations. We apply our approach to reasoning about security properties of a recently developed quantum secret sharing protocol.

Electronic Notes in Theoretical Computer ScienceFeb 1, 20112 citations

Classical Knowledge for Quantum Security

D'Hondt, Ellie, Mehrnoosh Sadrzadeh

arXiv:0808.3574Aug 26, 20080 citations

Classical Knowledge for Quantum Security

Ellie D’Hondt, Mehrnoosh Sadrzadeh

Aug 26, 20081 citation

Security of Quantum Key Distribution Protocols

Rotem Liss

The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.

Aug 31, 20220 citations

Quantum Security Proof Based on Quantum Decoherence

Jincheng Zhang

This paper investigates the potential of utilizing quantum decoherence as a foundation for enhanced computational security. Traditional cryptographic algorithms are increasingly vulnerable to attacks leveraging quantum computing capabilities. This research proposes a novel approach to secure key distribution by exploiting the inherent properties of quantum decoherence. We design a quantum key distribution (QKD) protocol that incorporates controlled quantum noise and environmental interactions, specifically leveraging the rapid decoherence of quantum states. The protocol's core principle is that the unpredictable nature of decoherence – the loss of quantum information due to interaction with the environment – makes it extraordinarily difficult for an eavesdropper to predict and exploit the key distribution process. The resulting security stems not from the laws of physics themselves, but from the attacker's inability to reliably model and manipulate the quantum system's rapidly evolving state. We present a mathematical framework to analyze the security of this protocol, highlighting key parameters influencing its resilience. This work offers a fundamentally new security paradigm, shifting the focus from algorithm-based security to a system-level approach centered around harnessing the chaotic nature of quantum decoherence. The presented scheme demonstrates a promising path toward building robust, quantum-resistant cryptographic systems.

Sep 2, 20260 citations