Sciweavers

208 search results - page 7 / 42
» Relations Among Privacy Notions
Sort
View
CSL
2002
Springer
13 years 8 months ago
On the Automatizability of Resolution and Related Propositional Proof Systems
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 ...
Albert Atserias, Maria Luisa Bonet
PODS
2006
ACM
121views Database» more  PODS 2006»
14 years 9 months ago
On the efficiency of checking perfect privacy
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...
Ashwin Machanavajjhala, Johannes Gehrke
AMAST
2000
Springer
14 years 1 months ago
Behavioural Subtyping Relations for Object-Oriented Formalisms
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...
Clemens Fischer, Heike Wehrheim
RSCTC
2000
Springer
140views Fuzzy Logic» more  RSCTC 2000»
14 years 16 days ago
Temporal Templates and Analysis of Time Related Data
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...
Piotr Synak
ISW
2009
Springer
14 years 3 months ago
Privacy-Aware Attribute-Based Encryption with User Accountability
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...
Jin Li, Kui Ren, Bo Zhu, Zhiguo Wan