Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme

摘要

In the model of perfectly secure message transmission (PSMT) schemes, there are $n$ channels between a sender and a receiver. An infinitely powerful adversary $ {bf 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 perfectly privately and perfectly reliably without sharing any key with the receiver.