3,199 research outputs found
Privacy via subsumption
We describe an object calculus allowing object extension and structural subtyping. Each object has a “dictionary ” to mediate the connection between names and components. This extra indirection yields the first object calculus combining both object extension and full width subtyping in a type-safe manner. If class inheritance is modeled with object extension, private fields and methods can be achieved directly by scoping restrictions: private fields or methods are those hidden by subsumption. We prove that the type system is sound, discuss a variant allowing covariant self types, and give some examples of the expressiveness of the calculus. C ○ 2002 Elsevier Scienc
Direct combination: a new user interaction principle for mobile and ubiquitous HCI
Direct Combination (DC) is a recently introduced user interaction principle. The principle (previously applied to desktop computing) can greatly reduce the degree of search, time, and attention required to operate user interfaces. We argue that Direct Combination applies particularly aptly to mobile computing devices, given appropriate interaction techniques, examples of which are presented here. The reduction in search afforded to users can be applied to address several issues in mobile and ubiquitous user interaction including: limited feedback bandwidth; minimal attention situations; and the need for ad-hoc spontaneous interoperation and dynamic reconfiguration of multiple devices. When Direct Combination is extended and adapted to fit the demands of mobile and ubiquitous HCI, we refer to it as Ambient Combination (AC) . Direct Combination allows the user to exploit objects in the environment to narrow down the range of interactions that need be considered (by system and user). When the DC technique of pairwise or n-fold combination is applicable, it can greatly lessen the demands on users for memorisation and interface navigation. Direct Combination also appears to offers a new way of applying context-aware information. In this paper, we present Direct Combination as applied ambiently through a series of interaction scenarios, using an implemented prototype system
Ontology-Based Quality Evaluation of Value Generalization Hierarchies for Data Anonymization
In privacy-preserving data publishing, approaches using Value Generalization
Hierarchies (VGHs) form an important class of anonymization algorithms. VGHs
play a key role in the utility of published datasets as they dictate how the
anonymization of the data occurs. For categorical attributes, it is imperative
to preserve the semantics of the original data in order to achieve a higher
utility. Despite this, semantics have not being formally considered in the
specification of VGHs. Moreover, there are no methods that allow the users to
assess the quality of their VGH. In this paper, we propose a measurement
scheme, based on ontologies, to quantitatively evaluate the quality of VGHs, in
terms of semantic consistency and taxonomic organization, with the aim of
producing higher-quality anonymizations. We demonstrate, through a case study,
how our evaluation scheme can be used to compare the quality of multiple VGHs
and can help to identify faulty VGHs.Comment: 18 pages, 7 figures, presented in the Privacy in Statistical
Databases Conference 2014 (Ibiza, Spain
A brave new world of Ambient Intelligence in the casinos of Macau: reality or fiction?
The article scrutinizes the brave new world of ambient intelligence in the casinos of the Macau, Special Administrative Region of People´s Republic of China, chiefly in regards to the (candent) issue of privacy of the casino patrons.
Moreover, this scientific article provides an overview about the secondary use of big data of the casino patrons for law enforcement purposes
A Survey of Symbolic Execution Techniques
Many security and software testing applications require checking whether
certain properties of a program hold for any possible usage scenario. For
instance, a tool for identifying software vulnerabilities may need to rule out
the existence of any backdoor to bypass a program's authentication. One
approach would be to test the program using different, possibly random inputs.
As the backdoor may only be hit for very specific program workloads, automated
exploration of the space of possible inputs is of the essence. Symbolic
execution provides an elegant solution to the problem, by systematically
exploring many possible execution paths at the same time without necessarily
requiring concrete inputs. Rather than taking on fully specified input values,
the technique abstractly represents them as symbols, resorting to constraint
solvers to construct actual instances that would cause property violations.
Symbolic execution has been incubated in dozens of tools developed over the
last four decades, leading to major practical breakthroughs in a number of
prominent software reliability applications. The goal of this survey is to
provide an overview of the main ideas, challenges, and solutions developed in
the area, distilling them for a broad audience.
The present survey has been accepted for publication at ACM Computing
Surveys. If you are considering citing this survey, we would appreciate if you
could use the following BibTeX entry: http://goo.gl/Hf5FvcComment: This is the authors pre-print copy. If you are considering citing
this survey, we would appreciate if you could use the following BibTeX entry:
http://goo.gl/Hf5Fv
RelBAC: Relation Based Access Control
TheWeb 2.0, GRID applications and, more recently, semantic desktop applications are bringing the Web to a situation where more and more data and metadata are shared and made available to large user groups. In this context, metadata may be tags or complex graph structures such as file system or web directories, or (lightweight) ontologies. In turn, users can themselves be tagged by certain properties, and can be organized in complex directory structures, very much in the same way as data. Things are further complicated by the highly unpredictable and autonomous dynamics of data, users, permissions and access control rules. In this paper we propose a new access control model and a logic, called RelBAC (for Relation Based Access Control) which allows us to deal with this novel scenario. The key idea, which differentiates RelBAC from the state of the art, e.g., Role Based Access Control (RBAC), is that permissions are modeled as relations between users and data, while access control rules are their instantiations on specific sets of users and objects. As such, access control rules are assigned an arity which allows a fine tuning of which users can access which data, and can evolve independently, according to the desires of the policy manager(s). Furthermore, the formalization of the RelBAC model as an Entity-Relationship (ER) model allows for its direct translation into Description Logics (DL). In turn, this allows us to reason, possibly at run time, about access control policies
Reasoning in Description Logic Ontologies for Privacy Management
A rise in the number of ontologies that are integrated and distributed in numerous application systems may provide the users to access the ontologies with different privileges and purposes. In this situation, preserving confidential information from possible unauthorized disclosures becomes a critical requirement. For instance, in the clinical sciences, unauthorized disclosures of medical information do not only threaten the system but also, most importantly, the patient data. Motivated by this situation, this thesis initially investigates a privacy problem, called the identity problem, where the identity of (anonymous) objects stored in Description Logic ontologies can be revealed or not. Then, we consider this problem in the context of role-based access control to ontologies and extend it to the problem asking if the identity belongs to a set of known individuals of cardinality smaller than the number k. If it is the case that some confidential information of persons, such as their identity, their relationships or their other properties, can be deduced from an ontology, which implies that some privacy policy is not fulfilled, then one needs to repair this ontology such that the modified one complies with the policies and preserves the information from the original ontology as much as possible. The repair mechanism we provide is called gentle repair and performed via axiom weakening instead of axiom deletion which was commonly used in classical approaches of ontology repair. However, policy compliance itself is not enough if there is a possible attacker that can obtain relevant information from other sources, which together with the modified ontology still violates the privacy policies. Safety property is proposed to alleviate this issue and we investigate this in the context of privacy-preserving ontology publishing. Inference procedures to solve those privacy problems and additional investigations on the complexity of the procedures, as well as the worst-case complexity of the problems, become the main contributions of this thesis.:1. Introduction
1.1 Description Logics
1.2 Detecting Privacy Breaches in Information System
1.3 Repairing Information Systems
1.4 Privacy-Preserving Data Publishing
1.5 Outline and Contribution of the Thesis
2. Preliminaries
2.1 Description Logic ALC
2.1.1 Reasoning in ALC Ontologies
2.1.2 Relationship with First-Order Logic
2.1.3. Fragments of ALC
2.2 Description Logic EL
2.3 The Complexity of Reasoning Problems in DLs
3. The Identity Problem and Its Variants in Description Logic Ontologies
3.1 The Identity Problem
3.1.1 Description Logics with Equality Power
3.1.2 The Complexity of the Identity Problem
3.2 The View-Based Identity Problem
3.3 The k-Hiding Problem
3.3.1 Upper Bounds
3.3.2 Lower Bound
4. Repairing Description Logic Ontologies
4.1 Repairing Ontologies
4.2 Gentle Repairs
4.3 Weakening Relations
4.4 Weakening Relations for EL Axioms
4.4.1 Generalizing the Right-Hand Sides of GCIs
4.4.2 Syntactic Generalizations
4.5 Weakening Relations for ALC Axioms
4.5.1 Generalizations and Specializations in ALC w.r.t. Role Depth
4.5.2 Syntactical Generalizations and Specializations in ALC
5. Privacy-Preserving Ontology Publishing for EL Instance Stores
5.1 Formalizing Sensitive Information in EL Instance Stores
5.2 Computing Optimal Compliant Generalizations
5.3 Computing Optimal Safe^{\exists} Generalizations
5.4 Deciding Optimality^{\exists} in EL Instance Stores
5.5 Characterizing Safety^{\forall}
5.6 Optimal P-safe^{\forall} Generalizations
5.7 Characterizing Safety^{\forall\exists} and Optimality^{\forall\exists}
6. Privacy-Preserving Ontology Publishing for EL ABoxes
6.1 Logical Entailments in EL ABoxes with Anonymous Individuals
6.2 Anonymizing EL ABoxes
6.3 Formalizing Sensitive Information in EL ABoxes
6.4 Compliance and Safety for EL ABoxes
6.5 Optimal Anonymizers
7. Conclusion
7.1 Main Results
7.2 Future Work
Bibliograph
- …