This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS).
Abstract. This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS).
Nov 25, 1997 · This paper provides new combinatorial bounds and characteriza- tions of authentication codes (A-codes) and key predistribution schemes. (KPS) ...
This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS). We first prove a ...
[PDF] New combinatorial bounds for universal families of hash functions
www.cs.ox.ac.uk › files › uhf
Abstract. We introduce a new lower bound on the key length, termed the combinatorial bound, in an -almost universal family of hash functions.
We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, ...
Saido, and D.R. Stinson. New combinatorial bounds for authentication codes and key predistribution schemes. Designs, Codes and Cryptography,15 (1998), 87-100.
The purpose of this monograph is to describe in depth classi- cal and current interconnections between combinatorial designs and authentication and secrecy ...
Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial ...
New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes ... bounds and characterizations of authentication codes (A-codes) and key ...