Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
The development of mobile communication technology and ubiquitous computing paradigm and the emergence of m-healthcare, m-business and m-education services have raised the urgency ...
This paper attempts to lay the foundation for future research into an area that has been called the "hottest workplace privacy topic of the next decade." The existing em...