Lower bounds on the probability of deception in authentication with arbitration

Thomas Johansson

doi:10.1109/18.333869

Lower bounds on the probability of deception in authentication with arbitration

Thomas Johansson

Department of Electrical and Information Technology

Research output: Contribution to journal › Article › peer-review

191 Downloads (Pure)

Abstract

The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality.

Original language	English
Pages (from-to)	1573-1585
Journal	IEEE Transactions on Information Theory
Volume	40
Issue number	5
DOIs	https://doi.org/10.1109/18.333869
Publication status	Published - 1994

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Access to Document

10.1109/18.333869

lower00333869

Cite this

@article{6806d8243cb74dfaaaa78f528ec20d67,

title = "Lower bounds on the probability of deception in authentication with arbitration",

abstract = "The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality.",

author = "Thomas Johansson",

year = "1994",

doi = "10.1109/18.333869",

language = "English",

volume = "40",

pages = "1573--1585",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Lower bounds on the probability of deception in authentication with arbitration

AU - Johansson, Thomas

PY - 1994

Y1 - 1994

N2 - The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality.

AB - The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality.

U2 - 10.1109/18.333869

DO - 10.1109/18.333869

M3 - Article

SN - 0018-9448

VL - 40

SP - 1573

EP - 1585

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

Lower bounds on the probability of deception in authentication with arbitration

Abstract

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this