2137 search results - page 171 / 428 » Proving Abstract Non-interference |
128
click to vote
AAECC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
163
Voted
TII
2008
15 years 3 months ago
2008
Abstract--Safety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however power...
112
click to vote
ENTCS
2000
15 years 3 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
137
click to vote
TIT
2008
15 years 2 months ago
2008
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
114
click to vote
LATINCRYPT
2010
15 years 1 months ago
2010
Abstract. A cryptographic accumulator is a scheme where a set of elements is represented by a single short value. This value, along with another value called witness, allows to pro...