\input zb-basic
\input zb-ioport
\iteman{io-port 06070097}
\itemau{Tuhin, Mohammed Ashraful Alam; Safavi-Naini, Reihaneh}
\itemti{Optimal one round almost perfectly secure message transmission (short paper).}
\itemso{Danezis, George (ed.), Financial cryptography and data security. 15th international conference, FC 2011, Gros Islet, St. Lucia, February 28--March 4, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-27575-3/pbk). Lecture Notes in Computer Science 7035, 173-181 (2012).}
\itemab
Summary: In this paper we consider 1-round almost perfectly secure message transmission protocols with optimal transmission rate, and give constructions for two levels of connectivity, $n = 2t + k$ and $n = (2+c)t, c > \frac{1}{t}$. Here $n$ and $t$ are the total number of wires and the number of corrupted wires, respectively, and $k$ and $c$ are constants. The first protocol has a modular construction that with appropriate instantiations of each module results in optimal protocols for $n = 2t + k$. The second protocol is the first construction for optimal protocol when $n = (2 + c)t$.
\itemrv{~}
\itemcc{}
\itemut{}
\itemli{doi:10.1007/978-3-642-27576-0\_14}
\end