Meny

Javascript is not activated in your browser. This website needs javascript activated to work properly.
Du är här

On the construction of perfect authentication codes that permit arbitration

Publiceringsår: 1993
Språk: Engelska
Sidor: 343-354
Publikation/Tidskrift/Serie: Advances in Cryptology / Lecture Notes in Computer Science
Volym: 773
Dokumenttyp: Konferensbidrag
Förlag: Springer-Verlag

Sammanfattning

Authentication codes that permit arbitration are codes that unconditionally protect against deceptions from the outsiders and additionally also protect against some forms of deceptions from the insiders. Simmons introduced this authentication model and he also showed a way of constructing such codes, called the Cartesian product construction. We present a general way of constructing such codes and we also derive two specific classes of such codes. One that is perfect in the sense that it meets the lower bounds on the size of the transmitter’s and the receiver’s keys and one that allows the number of source states to be chosen arbitrarily large.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

13th Annual International Cryptology Conference CRYPTO’ 93
1993-08-22/1993-08-26
Santa Barbara, California
Published
Yes
  • ISSN: 0302-9743
  • ISBN: 978-3-540-57766-9

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen