A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
In this paper we investigate the object-oriented notion of subtyping in the context of behavioural formalisms. Subtyping in OOformalisms is closely related to the concept of inheri...
In the paper we investigate the problem of analysis of time related information systems. We introduce notion of temporal templates, i.e. homogeneous patterns occurring in some peri...
As a new public key primitive, attribute-based encryption (ABE) is envisioned to be a promising tool for implementing fine-grained access control. To further address the concern o...