QKD in Isabelle -- Bayesian Calculation

05/01/2019
by   Florian Kammüller, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/16/2021

Asymptotically secure All-or-nothing Quantum Oblivious Transfer

We present a device independently secure quantum scheme for p-threshold ...
07/22/2019

Arrow's Theorem Through a Fixpoint Argument

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

Argument Calculus and Networks

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

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...
11/19/2019

Entanglement-based quantum private comparison protocol with bit-flipping

Quantum private comparison (QPC), whose security is based on the laws of...
09/07/2018

The Force of Proof by Which Any Argument Prevails

Jakob Bernoulli, working in the late 17th century, identified a gap in c...
02/13/2022

A Simplified Variant of Gödel's Ontological Argument

A simplified variant of Gödel's ontological argument is presented. The s...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.