Abstract
It is the aim to deal with codes having unconditional security, which means that the security is independent of the computing power. Analogously to the theory of unconditional secrecy due to Shannon [12], Simmons developed a theory of unconditional authentication [10]. In this paper we give some new bounds and constructions for authentication/secrecy codes with splitting.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Beth T., Jungnickel D., Lenz H., Design Theory. Wissenschaftsverlag Bibliografisches Institut Mannheim, 1985.
Brickell E. F., A few results in message authentication. Proc. of the 15th Southeastern Conf. on Combinatorics, Graph theory and Computing, Boca Raton LA (1984), 141–154.
De Soete M., Some Constructions for Authentication / Secrecy codes, Proceedings of Eurocrypt’88, Davos, L.N.C.S., to appear.
De Soete M., New Bounds and Constructions for Authentication / Secrecy Codes with Splitting. In preparation.
Gilbert E. N., MacWilliams F. J., Sloane N. J. A., Codes which detect deception. Bell Sys. Techn. J., Vol.53-3 (1974), 405–424.
Massey J. L., Cryptography-A Selective Survey. Proc. of 1985 Int. Tirrenia Workshop on Digital Communications, Tirrenia, Italy, 1985, Digital Communications, ed. E. Biglieri and G. Prati, Elsevier Science Publ. 1986, 3–25.
Payne S. E., Thas J. A., Finite generalized quadrangles. Research Notes in Math. #110, Pitman Publ. Inc. 1984.
Shrikhande S. S., Affine resolvable balanced incomplete block designs: a survey. Aequat. Math. 14 (1976), 251–269.
Simmons G. J., Message Authentication: A Game on Hypergraphs. Proc. of the 15th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge LA Mar 5–8 1984, Cong. Num. 45 (1984), 161–192.
Simmons G. J., Authentication theory / Coding theory. Proc. of Crypto’84, Santa Barbara, CA, Aug.19–22, 1984, Advances in Cryptology, ed. R. Blakley, Lect. Notes Comp. Science 196, Springer 1985, 411–432.
Simmons G. J., A natural taxonomy for digital information authentication schemes. Proc. of Crypto’ 87, Santa Barbara, CA, Aug 16–20, 1987, to appear in Advances in Cryptology, ed. C. Pomerance, Springer Verlag, Berlin.
Shannon C. E., Communication Theory of Secrecy Systems. Bell Technical Journal, Vol.28 (1949), 656–715.
Stinson D. R., Some Constructions and Bounds for Authentication Codes. J. Cryptology 1 (1988), 37–51.
Stinson D. R., A construction for authentication / secrecy codes from certain combinatorial designs. Crypto’ 87, Santa Barbara, CA, Aug 16–20, 1987, to appear in J. Cryptology.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Soete, M. (1990). Bounds and Constructions for Authentication - Secrecy Codes with Splitting. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_24
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_24
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive