Cryptography for unconditionally secure message transmission in networks (invited talk)

Abstract

We consider the model of unconditionally secure (r-round, n-channel) message transmission schemes which was introduced by Dolev et al. [1]. In this model, there are n channels between a sender and a receiver, and an infinitely powerful adversary A may corrupt (observe and forge) the messages sent through t out of n channels. The sender wishes to send a secret s to the receiver in r-round without sharing any key with the receiver.