DeepAI AI Chat
Log In Sign Up

QKD in Isabelle -- Bayesian Calculation

by   Florian Kammüller, et al.

In this paper, we present a first step towards a formalisation of the Quantum Key Distribution algorithm in Isabelle. We focus on the formalisation of the main probabilistic argument why Bob cannot be certain about the key bit sent by Alice before he does not have the chance to compare the chosen polarization scheme. This means that any adversary Eve is in the same position as Bob and cannot be certain about the transmitted keybits. We introduce the necessary basic probability theory, present a graphical depiction of the protocol steps and their probabilities, and finally how this is translated into a formal proof of the security argument.


page 1

page 2

page 3

page 4


Asymptotically secure All-or-nothing Quantum Oblivious Transfer

We present a device independently secure quantum scheme for p-threshold ...

Arrow's Theorem Through a Fixpoint Argument

We present a proof of Arrow's theorem from social choice theory that use...

Argument Calculus and Networks

A major reason behind the success of probability calculus is that it pos...

A General Counterexample to Any Decision Theory and Some Responses

In this paper I present an argument and a general schema which can be us...

Security of Covert Quantum Key Distribution under a Class of Coherent Attacks

We show that covert secret key expansion is possible against a restricte...

Succinct Classical Verification of Quantum Computation

We construct a classically verifiable succinct interactive argument for ...

A Simplified Variant of Gödel's Ontological Argument

A simplified variant of Gödel's ontological argument is presented. The s...