2137 search results - page 126 / 428 » Proving Abstract Non-interference |
102
click to vote
ACISP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. Highly nonlinear Boolean functions occupy an important position in the design of secure block as well as stream ciphers. This paper proves two new lower bounds on the non...
107
Voted
CONCUR
1997
Springer
15 years 7 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
119
Voted
ICICS
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that nonhomomorphic RSA-type cryptosystems...
110
click to vote
LICS
1994
IEEE
15 years 7 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
119
Voted
CAV
1993
Springer
15 years 7 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...