Zobrazeno 1 - 10
of 422
pro vyhledávání: '"Palamidessi, C."'
Publikováno v:
Logical Methods in Computer Science, Volume 5, Issue 2 (June 22, 2009) lmcs:1134
In this paper we investigate fair computations in the pi-calculus. Following Costa and Stirling's approach for CCS-like languages, we consider a method to label process actions in order to filter out unfair computations. We contrast the existing fair
Externí odkaz:
http://arxiv.org/abs/0904.2340
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
One of our principal aims in this work is to extend the reliable derivation of implementations from specifications –so long pursued in other areas like functionality, concurrency and probability– to include security as well, and in particular qua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::fc003047bcd493713291dbd3e25cab0e
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978892
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978892
Statistical databases store the data of a large number of individuals, and data analysts are allowed to pose statistical queries about those data. Typical queries include average values, total counting, or the percentage of the entries that satisfy a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::6ce357f56d2da20d6b0df4e473e1c300
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978898
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978898
Until this point, we have modeled systems as channels: either concretely as matrices of type $$\mathcal{X}\rightarrow\mathcal{Y}$$ for some input X and observation Y, or abstractly as functions $$\mathbb{D}\mathcal{X}\rightarrow\mathbb{D}^{2}\mathcal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::751a89025f91409439e989bb6d55eefd
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978886
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978886
In this chapter we develop the theory of channel capacity. In Def. 5.11 we considered for a fixed prior π and gain function g the idea of comparing prior and posterior vulnerabilities. As we noted in §6.2 however, in general one cannot be sure of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::c0572e2d6e9f5da5926ce2cf6131d0a5
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978902
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978902
We now consider the possibility that the adversary knows interesting correlations among different secrets, and we study the implications of that for information leakage. © Springer Nature Switzerland AG 2020.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::cecc50659beb5bca7ae6cc2f789a2fb4
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978894
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978894
Given a channel with input X, we have now seen that g-leakage provides us with a rich variety of ways to measure the information leakage of X that the channel causes. The prior models the adversary’s prior knowledge about X; the gain function g mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::6b7bcdf00da04798f438279b9f1ce65f
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978874
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:2978874