Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

On the construction of perfect authentication codes that permit arbitration

In English

Författare

Summary, in English

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.

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

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

13th Annual International Cryptology Conference CRYPTO’ 93

Conference date

1993-08-22 - 1993-08-26

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-540-57766-9