Abstract
The model of (r-round, n-channel) message transmission scheme (MTS) was introduced by Dolev et al. [5]. In their model, there are n channels between a sender S and a receiver R, and they do not share any information like keys. S wants to send a message to R secretly and reliably in r-round. But, there is an adversary A who can observe and forge at most t information which sent through n-channels.
In this paper, we propose almost secure (1-round, 3t+1 -channel) MTS. Proposed scheme has following two properties. (1) If sending message is large some degree, the communication bits for transmitting messages is much more efficient with comparing to the perfectly secure (1-round, 3t+1 -channel) MTS proposed by Dolev et.al [5]. (2) The running time of message decryption algorithm is polynomial in n.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berlekamp, E.R.: Algebraic Coding Theory, ch. 7. McGraw-Hill, New York (1968)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979, National Computer Conference, vol. 48, pp. 313–137 (1979); vol. 4(4), pp. 502–510 (1991)
Blakley, G.R., Meadows, C.: Security of Ramp Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 242–268. Springer, Heidelberg (1985)
Cramer, R., Dodis, Y., Fehr, S., Wichs, C.P.D.: Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471–488. Springer, Heidelberg (2008)
Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM 40(1), 17–47 (1993)
Fitzi, M., Franklin, M.K., Garay, J.A., Vardhan, S.H.: Towards Optimal and Efficient Perfectly Secure Message Transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 311–322. Springer, Heidelberg (2007)
Kurosawa, K., Obana, S., Ogata, W.: t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 410–423. Springer, Heidelberg (1995)
Kurosawa, K., Suzuki, K.: Almost Secure (1-Round, n-Channel) Message Transmission Scheme. In: ICITS 2008 (2008)
McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Com. Acm 24, 583–584 (1981)
Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)
Srinathan, K., Naraayanam, A., Pandu Rangan, C.: Optimal Perfectly Secure Message Transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545–561. Springer, Heidelberg (2004)
Obana, S.: Almost optimum t-Cheater Identifiable Secret Sharing Schemes. SCIS 2007 (in Japanese) (2007)
Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. Journal of the ACM 41(6), 1089–1109 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Araki, T. (2008). Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption. In: Safavi-Naini, R. (eds) Information Theoretic Security. ICITS 2008. Lecture Notes in Computer Science, vol 5155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85093-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-85093-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85092-2
Online ISBN: 978-3-540-85093-9
eBook Packages: Computer ScienceComputer Science (R0)