On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2
(1991) Conference on the Theory and Application of Cryptology, 1990 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 473 LNCS. p.306-312- Abstract
We present an analysis of some known cartesian authentication codes and their modification into authentication codes with secrecy, with transmission rate R = r/n, where n = 2, 3, …, and 1 ≤ r ≤ n - 1 using (n - r)(r + 1) q-ary key digits. For this purpose we use a grouping technique. Essentially the same key grouping technique is used for the construction of codes that withstand spoofing attacks of order L ≥ 2. The information rate of this scheme is also r/n, and it requires (L + r)(n - r) q-ary key digits. Moreover these codes allow that previously transmitted source states can be reused.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/32931dd9-aa21-4885-a22c-5b3198e972dd
- author
- Smeets, Ben
LU
; Vanroose, Peter and Wan, Zhe Xian LU
- organization
- publishing date
- 1991
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Advances in Cryptology — EUROCRYPT 1990 : Workshop on the Theory and Application of Cryptographic Techniques, Proceedings - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
- series title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- editor
- Damgard, Ivan Bjerre
- volume
- 473 LNCS
- pages
- 7 pages
- publisher
- Springer
- conference name
- Conference on the Theory and Application of Cryptology, 1990
- conference location
- Aarhus, Denmark
- conference dates
- 1990-05-21 - 1990-05-24
- external identifiers
-
- scopus:33749925176
- ISSN
- 0302-9743
- 1611-3349
- ISBN
- 9783540468776
- 9783540535874
- DOI
- 10.1007/3-540-46877-3_27
- language
- English
- LU publication?
- yes
- additional info
- Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1991.
- id
- 32931dd9-aa21-4885-a22c-5b3198e972dd
- date added to LUP
- 2021-11-05 02:40:34
- date last changed
- 2024-01-05 20:09:31
@inproceedings{32931dd9-aa21-4885-a22c-5b3198e972dd, abstract = {{<p>We present an analysis of some known cartesian authentication codes and their modification into authentication codes with secrecy, with transmission rate R = r/n, where n = 2, 3, …, and 1 ≤ r ≤ n - 1 using (n - r)(r + 1) q-ary key digits. For this purpose we use a grouping technique. Essentially the same key grouping technique is used for the construction of codes that withstand spoofing attacks of order L ≥ 2. The information rate of this scheme is also r/n, and it requires (L + r)(n - r) q-ary key digits. Moreover these codes allow that previously transmitted source states can be reused.</p>}}, author = {{Smeets, Ben and Vanroose, Peter and Wan, Zhe Xian}}, booktitle = {{Advances in Cryptology — EUROCRYPT 1990 : Workshop on the Theory and Application of Cryptographic Techniques, Proceedings}}, editor = {{Damgard, Ivan Bjerre}}, isbn = {{9783540468776}}, issn = {{0302-9743}}, language = {{eng}}, pages = {{306--312}}, publisher = {{Springer}}, series = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}}, title = {{On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2}}, url = {{http://dx.doi.org/10.1007/3-540-46877-3_27}}, doi = {{10.1007/3-540-46877-3_27}}, volume = {{473 LNCS}}, year = {{1991}}, }