On the construction of perfect authentication codes that permit arbitration
(1993) 13th Annual International Cryptology Conference CRYPTO’ 93 773. p.343-354- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1157325
- author
- Johansson, Thomas LU
- organization
- publishing date
- 1993
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Advances in Cryptology / Lecture Notes in Computer Science
- volume
- 773
- pages
- 343 - 354
- publisher
- Springer
- conference name
- 13th Annual International Cryptology Conference CRYPTO’ 93
- conference dates
- 1993-08-22 - 1993-08-26
- external identifiers
-
- scopus:84969365849
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 978-3-540-57766-9
- DOI
- 10.1007/3-540-48329-2_29
- language
- English
- LU publication?
- yes
- id
- 7d82590e-fcc8-49b0-809a-26d6ee878c18 (old id 1157325)
- date added to LUP
- 2016-04-01 11:56:58
- date last changed
- 2024-01-23 00:03:40
@inproceedings{7d82590e-fcc8-49b0-809a-26d6ee878c18, abstract = {{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.}}, author = {{Johansson, Thomas}}, booktitle = {{Advances in Cryptology / Lecture Notes in Computer Science}}, isbn = {{978-3-540-57766-9}}, issn = {{1611-3349}}, language = {{eng}}, pages = {{343--354}}, publisher = {{Springer}}, title = {{On the construction of perfect authentication codes that permit arbitration}}, url = {{http://dx.doi.org/10.1007/3-540-48329-2_29}}, doi = {{10.1007/3-540-48329-2_29}}, volume = {{773}}, year = {{1993}}, }