Combinatorial Bounds and Characterizations of Splitting Authentication Codes

Details Combinatorial Bounds and Characterizations of Splitting Authentication Codes Combinatorial Bounds and Characterizations of Splitting Authentication Codes

2010-01-21

arxiv.org/abs/1001.3780v1

Computer Science

Cryptography and Security

13 pages; to appear in "Cryptography and Communications"

Scientific paper

We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a combinatorial characterization of optimal splitting authentication codes that are multi-fold secure against spoofing attacks. The characterization is based on a new type of combinatorial designs, which we introduce and for which basic necessary conditions are given regarding their existence.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Bounds and Characterizations of Splitting Authentication Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Bounds and Characterizations of Splitting Authentication Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Bounds and Characterizations of Splitting Authentication Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-249142