Authentication codes and plaintext attack

R. Safavi-Naini; L. Tombak; J. Pieprzyk

doi:10.1109/ISIT.1994.395115

Authentication codes and plaintext attack

R. Safavi-Naini^*, L. Tombak, J. Pieprzyk

^*Corresponding author for this work

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

Abstract

We study authentication codes (A-codes) and obtain lower bounds on the probability of success and number of encoding rules when enemy uses plaintext or chosen plaintext attack. A-codes with minimum number of encoding rules that provide perfect protection for impersonation and substitution in these attacks are characterized and a general method of constructing A-codes that provide perfect protection for these attacks, using A-codes that provide perfect protection in its traditional sense, are given. The constructions are optimal as they produce A-codes with minimum number of encoding rules if the original A-code has the same property.

Original language	English
Title of host publication	IEEE International Symposium on Information Theory, 1994
Place of Publication	Pistacaway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1-1
Number of pages	1
ISBN (Print)	0780320158
DOIs	https://doi.org/10.1109/ISIT.1994.395115
Publication status	Published - 1994
Externally published	Yes
Event	Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: 27 Jun 1994 → 1 Jul 1994

Other

Other	Proceedings of the 1994 IEEE International Symposium on Information Theory
City	Trodheim, Norw
Period	27/06/94 → 1/07/94

Access to Document

10.1109/ISIT.1994.395115

Link to publication in Scopus

Cite this

@inproceedings{e543746fa5b04c87b62c76de08a90e07,

title = "Authentication codes and plaintext attack",

abstract = "We study authentication codes (A-codes) and obtain lower bounds on the probability of success and number of encoding rules when enemy uses plaintext or chosen plaintext attack. A-codes with minimum number of encoding rules that provide perfect protection for impersonation and substitution in these attacks are characterized and a general method of constructing A-codes that provide perfect protection for these attacks, using A-codes that provide perfect protection in its traditional sense, are given. The constructions are optimal as they produce A-codes with minimum number of encoding rules if the original A-code has the same property.",

author = "R. Safavi-Naini and L. Tombak and J. Pieprzyk",

year = "1994",

doi = "10.1109/ISIT.1994.395115",

language = "English",

isbn = "0780320158",

pages = "1--1",

booktitle = "IEEE International Symposium on Information Theory, 1994",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "Proceedings of the 1994 IEEE International Symposium on Information Theory ; Conference date: 27-06-1994 Through 01-07-1994",

}

Safavi-Naini, R, Tombak, L & Pieprzyk, J 1994, Authentication codes and plaintext attack. in IEEE International Symposium on Information Theory, 1994., 395115, Institute of Electrical and Electronics Engineers (IEEE), Pistacaway, NJ, pp. 1-1, Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, 27/06/94. https://doi.org/10.1109/ISIT.1994.395115

TY - GEN

T1 - Authentication codes and plaintext attack

AU - Safavi-Naini, R.

AU - Tombak, L.

AU - Pieprzyk, J.

PY - 1994

Y1 - 1994

N2 - We study authentication codes (A-codes) and obtain lower bounds on the probability of success and number of encoding rules when enemy uses plaintext or chosen plaintext attack. A-codes with minimum number of encoding rules that provide perfect protection for impersonation and substitution in these attacks are characterized and a general method of constructing A-codes that provide perfect protection for these attacks, using A-codes that provide perfect protection in its traditional sense, are given. The constructions are optimal as they produce A-codes with minimum number of encoding rules if the original A-code has the same property.

AB - We study authentication codes (A-codes) and obtain lower bounds on the probability of success and number of encoding rules when enemy uses plaintext or chosen plaintext attack. A-codes with minimum number of encoding rules that provide perfect protection for impersonation and substitution in these attacks are characterized and a general method of constructing A-codes that provide perfect protection for these attacks, using A-codes that provide perfect protection in its traditional sense, are given. The constructions are optimal as they produce A-codes with minimum number of encoding rules if the original A-code has the same property.

UR - http://www.scopus.com/inward/record.url?scp=0028695591&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1994.395115

DO - 10.1109/ISIT.1994.395115

M3 - Conference proceeding contribution

AN - SCOPUS:0028695591

SN - 0780320158

SP - 1

EP - 1

BT - IEEE International Symposium on Information Theory, 1994

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Pistacaway, NJ

T2 - Proceedings of the 1994 IEEE International Symposium on Information Theory

Y2 - 27 June 1994 through 1 July 1994

ER -

Authentication codes and plaintext attack

Abstract

Other

Access to Document

Fingerprint

Cite this