Bounds and characterizations of authentication/secrecy schemes

DOI10.1023/A:1008270111149MaRDI QIDQ1378878zbMATH OpenOpenAlexFDO

Authors J. Ning

Publication date 9 February 1998

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

Full work available at URL https://doi.org/10.1023/a:1008270111149

zbMATH Keywords

authenticationentropyorthogonal arrayssecrecy schemes

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2127882
• Information-theoretic bounds for authentication schemes
• The combinatorics of authentication and secrecy codes
• Authentication codes: an area where coding and cryptology meet
• Authentication Theory/Coding Theory

Cited in

(14)

• A construction for optimal \(c\)-splitting authentication and secrecy codes
• Three constructions of authentication/secrecy codes
• A class of authentication codes with secrecy
• The power of primes: security of authentication based on a universal hash-function family
• Information-theoretically secure entity authentication in the multi-user setting
• Коды аутентификации с секретностью (обзор)
• Full and partial deniability for authentication schemes
• Information Theoretic Bounds on Authentication Systems in Query Model
• General lower bounds for chosen-content attacks against authentication codes
• Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths
• scientific article; zbMATH DE number 7310202 (Why is no real title available?)
• Progress in Cryptology - INDOCRYPT 2004
• Information-theoretic bounds for authentication schemes
• Authentication codes and bipartite graphs

This page was built for publication: Bounds and characterizations of authentication/secrecy schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378878)