Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially
[14, 177]): Is it possible to give combinatorial characterizations as well as constructions of optimal codes (with and without secrecy requirements)? We study authentication codes with splitting in this section. In such a code, ...
Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory.
Authentication without Secrecy The three participants are again Alice , Bob , and Oscar . Suppose that Oscar has the ability to introduce his own messages into the channel and / or to modify existing messages .
Williamson - type matrices if they are pairwise amicable ( see $ 2.1 ) , or 3. Goethals - Seidel type matrices if they are type I. 1.37 Construction Replacing variables of W ( from Examples 1.33 ) with Williamson matrices A , B , C , D ...
Focusing on a major part of this subject, Introduction to Combinatorial Designs, Second Edition provides a solid foundation in the classical areas of design theory as well as in more contemporary designs based on applications in a variety ...
Thus, it was de cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present volume.
Authentication codes with splitting The term splitting refers to the situation where there can be more than one ... In the case of authentication without secrecy, it can be shown that Pd, Z 1/ [Al for 0 3 i 3 t (see, for example, [63]).
Distributed joint source-channel coding on a multiple access channel / Vinod Sharma and R. Rajesh -- pt. 4. Other selected topics in information and coding theory. ch. 11.
This book presents survey articles on some of these new developments. The topics focus on material which has not yet been presented in other books or survey articles.
... Codes Cryptogr. 58(1), 73–88 (2011) 424. D. Crnkovic, A series of regular Hadamard matrices. Designs Codes Cryptogr. 39(2), 247– 251 (2006) 425. Y.J. Ionin, Regular Hadamard matrices generating infinite families of symmetric designs.