Attacking and defending multiple valuable secrets in a big data world

Konrad, Kai A.

doi:10.1016/j.ejor.2019.07.064

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Attacking and defending multiple valuable secrets in a big data world

MPS-Authors

/persons/resource/persons51208

Konrad, Kai A.
Public Economics, MPI for Tax Law and Public Finance, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Konrad, K. A. (2020). Attacking and defending multiple valuable secrets in a big data world. European Journal of Operational Research, 280(3), 1122-1129. doi:10.1016/j.ejor.2019.07.064.

Cite as: https://hdl.handle.net/21.11116/0000-0005-BEB5-9

Abstract

This paper studies the attack-and-defence game between a web user and a whole set of players over this user’s ‘valuable secrets.’ The number and type of these valuable secrets are the user’s private information. Attempts to tap information as well as privacy protection are costly. The multiplicity of secrets is of strategic value for the holders of these secrets. Users with few secrets keep their secrets private with some probability, even though they do not protect them. Users with many secrets protect their secrets at a cost that is smaller than the value of the secrets protected. The analysis also accounts for multiple redundant information channels with cost asymmetries, relating the analysis to attack-and-defence games with a weakest link.