On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2

Ben Smeets; Peter Vanroose; Zhe Xian Wan

doi:10.1007/3-540-46877-3_27

On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2

Ben Smeets, Peter Vanroose, Zhe Xian Wan

Department of Electrical and Information Technology

Lund University

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

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.

Original language	English
Title of host publication	Advances in Cryptology — EUROCRYPT 1990
Subtitle of host publication	Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Ivan Bjerre Damgard
Publisher	Springer
Pages	306-312
Number of pages	7
ISBN (Electronic)	9783540468776
ISBN (Print)	9783540535874
DOIs	https://doi.org/10.1007/3-540-46877-3_27
Publication status	Published - 1991
Event	Conference on the Theory and Application of Cryptology, 1990 - Aarhus, Denmark Duration: 1990 May 21 → 1990 May 24

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	473 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Conference on the Theory and Application of Cryptology, 1990
Country/Territory	Denmark
City	Aarhus
Period	1990/05/21 → 1990/05/24

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

Subject classification (UKÄ)

Telecommunications

Access to Document

10.1007/3-540-46877-3_27

Cite this

Smeets, B., Vanroose, P., & Wan, Z. X. (1991). On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2. In I. B. Damgard (Ed.), Advances in Cryptology — EUROCRYPT 1990: Workshop on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 306-312). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 473 LNCS). Springer. https://doi.org/10.1007/3-540-46877-3_27

Smeets, Ben ; Vanroose, Peter ; Wan, Zhe Xian. / On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2. Advances in Cryptology — EUROCRYPT 1990: Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. editor / Ivan Bjerre Damgard. Springer, 1991. pp. 306-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{32931dd9aa214885a22c5b3198e972dd,

title = "On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2",

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.",

author = "Ben Smeets and Peter Vanroose and Wan, \{Zhe Xian\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; Conference on the Theory and Application of Cryptology, 1990 ; Conference date: 21-05-1990 Through 24-05-1990",

year = "1991",

doi = "10.1007/3-540-46877-3\_27",

language = "English",

isbn = "9783540535874",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "306--312",

editor = "Damgard, \{Ivan Bjerre\}",

booktitle = "Advances in Cryptology — EUROCRYPT 1990",

address = "Germany",

}

Smeets, B, Vanroose, P & Wan, ZX 1991, On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2. in IB Damgard (ed.), Advances in Cryptology — EUROCRYPT 1990: Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 473 LNCS, Springer, pp. 306-312, Conference on the Theory and Application of Cryptology, 1990, Aarhus, Denmark, 1990/05/21. https://doi.org/10.1007/3-540-46877-3_27

On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2. / Smeets, Ben; Vanroose, Peter; Wan, Zhe Xian.
Advances in Cryptology — EUROCRYPT 1990: Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Ivan Bjerre Damgard. Springer, 1991. p. 306-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 473 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

TY - GEN

T1 - On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2

AU - Smeets, Ben

AU - Vanroose, Peter

AU - Wan, Zhe Xian

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33749925176

U2 - 10.1007/3-540-46877-3_27

DO - 10.1007/3-540-46877-3_27

M3 - Paper in conference proceeding

AN - SCOPUS:33749925176

SN - 9783540535874

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 306

EP - 312

BT - Advances in Cryptology — EUROCRYPT 1990

A2 - Damgard, Ivan Bjerre

PB - Springer

T2 - Conference on the Theory and Application of Cryptology, 1990

Y2 - 21 May 1990 through 24 May 1990

ER -

Smeets B, Vanroose P, Wan ZX. On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2. In Damgard IB, editor, Advances in Cryptology — EUROCRYPT 1990: Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Springer. 1991. p. 306-312. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-46877-3_27

On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2

Abstract

Publication series

Conference

Bibliographical note

Subject classification (UKÄ)

Access to Document

Other files and links

Fingerprint

Cite this