Bounds and characterizations of authentication/secrecy schemes

DOI10.1023/A:1008270111149zbMath0895.94010OpenAlexW1529098903MaRDI QIDQ1378878

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

entropyorthogonal arraysauthenticationsecrecy schemes

Mathematics Subject Classification ID

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

Related Items (7)

A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ A class of authentication codes with secrecy ⋮ Authentication codes and bipartite graphs ⋮ Three constructions of authentication/secrecy codes ⋮ The power of primes: security of authentication based on a universal hash-function family ⋮ Коды аутентификации с секретностью (обзор) ⋮ Unnamed Item

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