Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes

DOI10.1007/BF00125078zbMath0864.94022OpenAlexW2020220799MaRDI QIDQ1910425

Yanyan Li

Publication date: 30 June 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00125078

zbMATH Keywords

block cipherspseudo-random sequencesauthenticationsecret sharing schemes

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Unnamed Item

Cites Work

• Information-theoretic bounds for authentication schemes
• Key-minimal cryptosystems for unconditional secrecy
• Local randomness in pseudorandom sequences
• Some improved bounds on the information rate of perfect secret sharing schemes
• A lower bound on authentication after having observed a sequence of messages
• How to share a secret
• Communication Theory of Secrecy Systems*
• The Combinatorics of Perfect Authentication Schemes
• Codes Which Detect Deception
• Unnamed Item
• Unnamed Item

This page was built for publication: Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes