Standard

Secret communication when the eavesdropper might be an active adversary. / Garnaev, A.; Trappe, W.

In: Lecture Notes in Computer Science, Vol. 8715, 2014, p. 121-136.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Garnaev, A. ; Trappe, W. / Secret communication when the eavesdropper might be an active adversary. In: Lecture Notes in Computer Science. 2014 ; Vol. 8715. pp. 121-136.

BibTeX

@article{5fc88de915104066b0bdd35ac0eadb7c,
title = "Secret communication when the eavesdropper might be an active adversary",
abstract = "We study how secret communication can be effected by the fact that an adversary{\textquoteright}s capability to eavesdrop on a collection of communications from a base station to a set of users may be restricted and unknown to the transmitter. In this situation, the eavesdropping adversary might have to choose which user to eavesdrop upon if it cannot eavesdrop upon the full set. Thus, the transmitter must make a decision on how to better maintain secret communication, and to do this it must take into account that the eavesdropper might possibly be passive or could be an active adversary that must actively make a choice about which user to eavesdrop upon. Using an example of a Bayesian game-theoretical model with unknown eavesdropping capacity we show why it is important to incorporate in a secret transmission protocol the possibility of an eavesdropper having restricted eavesdropping capacity. Also, since the equilibrium strategies are obtained explicitly, we establish some interesting properties that can guide deployment o",
author = "A. Garnaev and W. Trappe",
year = "2014",
doi = "10.1007/978-3-319-10262-7_12",
language = "English",
volume = "8715",
pages = "121--136",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Nature",

}

RIS

TY - JOUR

T1 - Secret communication when the eavesdropper might be an active adversary

AU - Garnaev, A.

AU - Trappe, W.

PY - 2014

Y1 - 2014

N2 - We study how secret communication can be effected by the fact that an adversary’s capability to eavesdrop on a collection of communications from a base station to a set of users may be restricted and unknown to the transmitter. In this situation, the eavesdropping adversary might have to choose which user to eavesdrop upon if it cannot eavesdrop upon the full set. Thus, the transmitter must make a decision on how to better maintain secret communication, and to do this it must take into account that the eavesdropper might possibly be passive or could be an active adversary that must actively make a choice about which user to eavesdrop upon. Using an example of a Bayesian game-theoretical model with unknown eavesdropping capacity we show why it is important to incorporate in a secret transmission protocol the possibility of an eavesdropper having restricted eavesdropping capacity. Also, since the equilibrium strategies are obtained explicitly, we establish some interesting properties that can guide deployment o

AB - We study how secret communication can be effected by the fact that an adversary’s capability to eavesdrop on a collection of communications from a base station to a set of users may be restricted and unknown to the transmitter. In this situation, the eavesdropping adversary might have to choose which user to eavesdrop upon if it cannot eavesdrop upon the full set. Thus, the transmitter must make a decision on how to better maintain secret communication, and to do this it must take into account that the eavesdropper might possibly be passive or could be an active adversary that must actively make a choice about which user to eavesdrop upon. Using an example of a Bayesian game-theoretical model with unknown eavesdropping capacity we show why it is important to incorporate in a secret transmission protocol the possibility of an eavesdropper having restricted eavesdropping capacity. Also, since the equilibrium strategies are obtained explicitly, we establish some interesting properties that can guide deployment o

U2 - 10.1007/978-3-319-10262-7_12

DO - 10.1007/978-3-319-10262-7_12

M3 - Article

VL - 8715

SP - 121

EP - 136

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

ID: 5733947