On the Security and Composability of the One Time Pad.
Dominik Raub, Rainer Steinwandt, Jörn Müller‐Quade
Abstract
Abstract. Motivated by a potentially flawed deployment of the one time pad in a recent quantumcryptographic application securing a bank transfer [12], we show how to implement a statistically secure system for message passing, that is, a channel with negligible failure rate secure againstunbounded adversaries, using a one time pad based cryptosystem. We prove the security of our system in the framework put forward by Backes, Pfitzmann, and Waidner [11, 2, 3]. 1 Introduction It is well known that the one time pad (OTP) is perfectly concealing, i.e. that given an arbitrary ciphertext c 2 {0, 1}n, the probability of any message m 2 M ` {0, 1}n is P (m|c) = P (m) where M denotes themessage space. Therefore one time pad based encryption is the obvious choice when dealing with unbounded