Abstract
In this paper we use results on authentication schemes to derive alternative proofs for results on perfect local randomnes in pseudo-random sequences, on block cipher systems which afford perfect secrecy against known plaintext attacks and on secret sharing schemes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. R. Blakley, Safeguading cryprographic keys, Proc AFIPS 1979 Natl. Conputer Conf, New York, 48 (1979) pp. 113–317.
E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. of Cryptology, Vol. 5 (1992) pp. 153–166.
E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, Codes which detect deception, Bell System Technical Journal, Vol. 53 (1974) pp. 405–424.
P. Godlewski and C. Mitchell, Key-minimal cryptosystems for unconditional secrecy, J. of Cryptology, Vol. 3 (1990) pp. 1–25.
U. M. Maurer and J. L. Massey, Local randomness in pseudo-random sequences, J. of Cryptology, Vol. 4 (1991) pp135–149.
J. L. Massey, Cryptography-a selective survey, in Digital Communications, C. Biglieri and C. Prati (Eds.), Elsevier (North-Holland) (1986) pp 3–21.
C. Mitchell, M. Walker and P. Wild, The combinatories of perfect authentication schemes, SIAM J. Disc. Math., Vol. 7 (1994) pp. 102–107.
U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, J. of Cryptology, Vol. 6 (1993) pp. 135–156.
A. Shamir, How to share a secret, Comm. of the ACM, Vol. 22 (1979) pp. 612–613.
C. E. Shannon. Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28 (1949) pp. 656–715.
G. J. Simmons, A game theoretical model of digital message authentication, Congressus Numerantium, Vol. 34 (1982) pp. 413–424.
G. J. Simmons, Authentication theory/coding theory, Advances In Cryptology: Crypto 84, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 196 (1985) pp411–431.
G. J. Simmons, Robust shared secret schemes or ‘how to be sure you have the right answer even though you don't know the question’, Congressus Numerantium, Vol. 68 (1989) pp. 215–248.
G. J. Simmons, How to (really) share a secret, Advances in Cryptology: Crypto 88, Lecture Notes in Computer Science, Springer Verlag, Berlin, 403 (1990) pp. 390–448.
G. J. Simmons, W.-A. Jackson, and K. M. Martin, The geometry of shared secret schemes, Bull of the ICA, Vol. 1 (1991) pp. 71–78.
M. Walker, Information-theoretic bounds for authentication schemes, J. of Cryptology (1990) pp. 131–143.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mitchell, C.J., Piper, F.C., Walker, M. et al. Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes. Designs, Codes and Cryptography 7, 101–110 (1996). https://doi.org/10.1023/A:1018052831124
Issue Date:
DOI: https://doi.org/10.1023/A:1018052831124