Math 2.0

Resources / preprint

A Game-Theoretic Approach to Information-Flow Control via Protocol Composition 718SP8YERQ

URIm2://res/718SP8YERQ
Kindpreprint
CreatorsMário S. Alvim, Konstantinos Chatzikokolakis, Yusuke Kawamoto, Catuscia Palamidessi
Date2018-03-27
Subjectsarxiv cs.CR, arxiv cs.GT, arxiv cs.IT, arxiv cs.LO, arxiv math.IT
Scopeborder

Expressions

e1: version, preprint

Date2018-03-27
IdsarXiv 1803.10042, DOI 10.3390/e20050382

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
118VESYRSNexampleexample A6arxiv
Game II $\geqslant$ Game Istatementproposition A1arxiv
visible choice $\geqslant$ hidden choicestatementproposition A4arxiv
Pure-strategy Nash equilibria in Game III and equivalence of $ \distr(\calad)$ and $(\cala\rightarrow \distr(\cald))$statementtheorem A5arxiv
Convex-linear payoff functionstatementcorollary A1arxiv
Characterization of channel equivalencestatementlemma A1arxiv
Game I $\geqslant$ Game IIIstatementproposition A2arxiv
Idempotencystatementproposition 4.3arxiv
Timing side-channelsexampleexample A4arxiv
BZDTYY5M6Jstatementproposition A5arxiv
Pure-strategy Nash equilibrium in Game II - strategies of type $\distr(\calda)$statementtheorem A3arxiv
Game IV $\geqslant$ Game VI$_{\sf m}$statementproposition A3arxiv
Properties of binary visible choicestatementproposition B.2arxiv
FD8TPWSM4Kexampleexample A7arxiv
G2V3MM540Rexampleexample A10arxiv
\qm{Reorganization of operatorsstatementproposition 4.4arxiv
Properties of the binary hidden choicestatementproposition B.1arxiv
Game I $\geqslant$ Game IVstatementcorollary A3arxiv
PSKVMMSC3Pexampleexample A9arxiv
von Neumann's minimax theoremstatementtheorem A1arxiv
Differential privacyexampleexample A1arxiv
Pure-strategy Nash equilibrium in Game II - strategies of type $\cald \rightarrow \distr(\cala)$statementtheorem A4arxiv
QK6HX1QP2Wstatementtheorem A7arxiv
Dining cryptographersexampleexample A2arxiv
Type of hidden choicestatementproposition 4.1arxiv
Equivalence of channelsdefinitiondefinition A1arxiv
CRIME attackexampleexample A3arxiv
Convexity/linearity of posterior vulnerability w.r.t. choicesstatementtheorem A2arxiv
W4GZ7Q2DM4statementcorollary A5arxiv
WG3A0SE01Gexampleexample A8arxiv
Game III $\geqslant$ Game VI$_{\sf m}$statementcorollary A4arxiv
Distributivity of $\vchoice{p}$ over $\hchoice{q}$statementproposition B.3arxiv
XPH1JV4P7Zexampleexample A5arxiv
Type of visible choicestatementproposition 4.2arxiv
Equivalence of optimal strategies of types $\distr(\calda)$ and $\cald \rightarrow \distr(\cala)$ in Game IIstatementcorollary A2arxiv
Attacker's pure-strategy Nash equilibrium in Game VIstatementtheorem A6arxiv

Catalogue records