Information Theoretic Authentication and Secrecy Codes in the Splitting Model

Details Information Theoretic Authentication and Secrecy Codes in the Splitting Model Information Theoretic Authentication and Secrecy Codes in the Splitting Model

2011-11-30

arxiv.org/abs/1112.0038v1

Computer Science

Cryptography and Security

4 pages (double-column); to appear in Proc. 2012 International Zurich Seminar on Communications (IZS 2012, Zurich)

Scientific paper

In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect of secrecy should hold simultaneously. Ogata-Kurosawa-Stinson-Saido (2004) have constructed optimal splitting authentication codes achieving perfect secrecy for the special case when the number of keys equals the number of messages. In this paper, we establish a construction method for optimal splitting authentication codes with perfect secrecy in the more general case when the number of keys may differ from the number of messages. To the best knowledge, this is the first result of this type.

Affiliated with

Also associated with

No associations

Rating

Information Theoretic Authentication and Secrecy Codes in the Splitting Model 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 Information Theoretic Authentication and Secrecy Codes in the Splitting Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information Theoretic Authentication and Secrecy Codes in the Splitting Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-412385