Abstract
It is known that perfectly secure (1-round, n-channel) message transmission (MT) schemes exist if and only if n ≥ 3t + 1, where t is the number of channels that the adversary can corrupt. Then does there exist an almost secure MT scheme for n = 2t + 1 ? In this paper, we first sum up a number flaws of the previous almost secure MT scheme presented at Crypto 2004. We next show an equivalence between almost secure MT schemes and secret sharing schemes with cheaters. By using our equivalence, we derive a lower bound on the communication complexity of almost secure MT schemes. Finally, we present a near optimum scheme which meets our bound approximately. This is the first construction of provably secure almost secure (1-round, n-channel) MT schemes for n = 2t + 1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, S., Cramer, R., de Haan, R.: Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 394–408. Springer, Heidelberg (2006)
Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly Secure Message Transmission. J. ACM 40(1), 17–47 (1993)
MacWilliams, F.J., Sloanem, N.J.A.: The Theory of Error-correcting Codes. North-Holland, Amsterdam (1981)
Ogata, W., Kurosawa, K., Stinson, D.: Optimum Secret Sharing Scheme Secure against Cheating. SIAM J. Discrete Math. 20(1), 79–95 (2006)
Sayeed, H.M., Abu-Amara, H.: Efficient Perfectly Secure Message Transmission in Synchronous Networks. Inf. Comput. 126(1), 53–61 (1996)
Srinathan, K., Narayanan, A., Pandu Rangan, C.: Optimal Perfectly Secure Message Transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545–561. Springer, Heidelberg (2004)
Tompa, M., Woll, H.: How to share a secret with cheaters. Journal of Cryptology 1, 133–138 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Suzuki, K. (2009). Almost Secure (1-Round, n-Channel) Message Transmission Scheme. In: Desmedt, Y. (eds) Information Theoretic Security. ICITS 2007. Lecture Notes in Computer Science, vol 4883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10230-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-10230-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10229-5
Online ISBN: 978-3-642-10230-1
eBook Packages: Computer ScienceComputer Science (R0)