Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
type: Item
instance of: scholarly article
title: Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
zbMATH Open document ID: 0864.94022
DOI: 10.1007/BF00125078
author: Yanyan Li
published in: Designs, Codes and Cryptography
publication date: 1997-06-30T00:00:00Z
review text: Shannon showed in his classic theory that if a cipher system provides perfect secrecy the number of keys is greater than the number of messages. In the 1980's Simmons developed the theory of authentication, relating the size of the key space to the probability of deception. In 1990 \textit{M. Walker} [J. Cryptology 2, No. 3, 131-143 (1990; Zbl 0705.94008)] gave information-theoretic bounds relating the entropy of the key space to the probability of deception for cartesian authentication schemes. This paper shows how to apply Walker's result to other cryptographic concepts such as perfect local randomness in pseudo-random sequences, perfect secrecy against known plaintext attacks on block ciphers, and secret sharing schemes. When Walker's bounds are met, the probability of success of an eavesdropper or spoofer is reduced to guessing the key stream or the authentic encoded messages. Applying bounds of Walker on authentication schemes, a bound on the number of keys required of a block cipher providing perfect secrecy against known plaintext attacks is given. Finally, a relationship between secret sharing schemes and authentication schemes is established.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 863674
zbMATH Keywords: authentication
zbMATH Keywords: pseudo-random sequences
zbMATH Keywords: block ciphers
zbMATH Keywords: secret sharing schemes
reviewed by: Günther Eigenthaler
MaRDI profile type: Publication
cites work: Some improved bounds on the information rate of perfect secret sharing schemes
cites work: Codes Which Detect Deception
cites work: Key-minimal cryptosystems for unconditional secrecy
cites work: Local randomness in pseudorandom sequences
cites work: The Combinatorics of Perfect Authentication Schemes
cites work: A lower bound on authentication after having observed a sequence of messages
cites work: How to share a secret
cites work: Communication Theory of Secrecy Systems*
cites work: Q3495231
cites work: Q4853712
cites work: Information-theoretic bounds for authentication schemes
full work available at URL: https://doi.org/10.1007/bf00125078
OpenAlex ID: W2020220799
Recommended article: Q3486510
Recommended article: Randomness in distribution protocols
Recommended article: Reply to: ``Comment on: `Exposed-key weakness of \(\alpha \eta \)' [Phys. Lett. A 370 (2007) 131]'' [Phys. Lett. A 372 (2008) 7091]
Recommended article: A large-deviations notion of perfect secrecy
Recommended article: Q4036892
Recommended article: The Practice of Authentication
Recommended article: Q4288075
Recommended article: Q4858451
Recommended article: Q4011777
Recommended article: Some information-theoretic problems of discrete data protection
description: scientific article; zbMATH DE number 863674