5084 search results - page 51 / 1017 » Proving Possibility Properties |
118
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
CORR
2006
Springer
15 years 3 months ago
2006
Springer
McLean's notion of Selective Interleaving Functions (SIFs) is perhaps the bestknown attempt to construct a framework for expressing various security properties. We examine th...
166
click to vote
CSFW
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
128
click to vote
ICECCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
110
click to vote
ICISC
2007
15 years 4 months ago
2007
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...