Results 1 - 10
of
17
Privacy-Preserving Reasoning on the Semantic Web
"... Many semantic web applications require selective sharing of ontologies between autonomous entities due to copyright, privacy or security concerns. In such cases, an agent might want to hide a part of its ontology while sharing the rest. However, prohibiting any use of the hidden part of the ontology ..."
Abstract
-
Cited by 12 (2 self)
- Add to MetaCart
(Show Context)
Many semantic web applications require selective sharing of ontologies between autonomous entities due to copyright, privacy or security concerns. In such cases, an agent might want to hide a part of its ontology while sharing the rest. However, prohibiting any use of the hidden part of the ontology in answering queries from other agents may be overly restrictive. We provide a framework for privacypreserving reasoning in which an agent can safely answer queries against its knowledge base using inferences drawn based on both the hidden and visible part of the knowledge base, without revealing the hidden knowledge. We show an application of this framework in the widely used special case of hierarchical ontologies. 1
XML Security — A Comparative Literature Review
"... Since the turn of the millenium, Working Groups of the W3C have been concentrating on the development of XML based security standards, which are paraphrased as XML Security. XML Security consists of three recommendations: XML (Digital) Signature, XML Encryption and XML Key Management Specification ( ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
Since the turn of the millenium, Working Groups of the W3C have been concentrating on the development of XML based security standards, which are paraphrased as XML Security. XML Security consists of three recommendations: XML (Digital) Signature, XML Encryption and XML Key Management Specification (XKMS), all of them published by the W3C. By means of a review of the available literature the authors draw several conclusions about the status quo of XML Security. Furthermore the current state and focuses of research as well as the existing challenges are derived. Trends to different application areas- e.g. use of XML Security for Mobile Computing- are also outlined. Based on this information the analyzed results are discussed and a future outlook is predicted.
F.: Access Control for HTTP Operations on Linked Data
- In: Procs of ESWC. Lecture Notes in Computer Science
, 2013
"... Abstract. Access control is a recognized open issue when interacting with RDF using HTTP methods. In literature, authentication and authorization mechanisms either introduce undesired complexity such as SPARQL and ad-hoc policy languages, or rely on basic access control lists, thus resulting in limi ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Access control is a recognized open issue when interacting with RDF using HTTP methods. In literature, authentication and authorization mechanisms either introduce undesired complexity such as SPARQL and ad-hoc policy languages, or rely on basic access control lists, thus resulting in limited policy expressiveness. In this paper we show how the Shi3ld attribute-based authorization framework for SPARQL endpoints has been progressively converted to protect HTTP operations on RDF. We proceed by steps: we start by supporting the SPARQL 1.1 Graph Store Protocol, and we shift towards a SPARQL-less solution for the Linked Data Platform. We demonstrate that the resulting authorization framework provides the same functionalities of its SPARQL-based counterpart, including the adoption of Semantic Web languages only. 1
Information-seeking on the Web with Trusted Social Networks – from Theory to Systems
, 2008
"... This research investigates how synergies between the Web and social networks can enhance the process of obtaining relevant and trustworthy information. A review of literature on personalised search, social search, recommender systems, social networks and trust propagation reveals limitations of exis ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
This research investigates how synergies between the Web and social networks can enhance the process of obtaining relevant and trustworthy information. A review of literature on personalised search, social search, recommender systems, social networks and trust propagation reveals limitations of existing technology in areas such as relevance, collaboration, task-adaptivity and trust. In response to these limitations I present a Web-based approach to information-seeking using social networks. This approach takes a source-centric perspective on the information-seeking process, aiming to identify trustworthy sources of relevant information from within the user's social network. An empirical study of source-selection decisions in information- and recommendationseeking identified five factors that influence the choice of source, and its perceived trustworthiness. The priority given to each of these factors was found to vary according to the criticality and subjectivity of the task. A series of algorithms have been developed that operationalise three of these factors (expertise, experience, affinity) and generate from various data sources a number of trust metrics for use in social network-based information seeking. The most significant of these data sources is Revyu.com, a reviewing and rating Web site implemented as part of this research, that takes input from regular users and makes it available on the Semantic Web for easy re-use by the implemented algorithms. Output of the algorithms is used in Hoonoh.com, a Semantic Web-based system that has been developed to support users in identifying relevant and trustworthy information sources within their social networks. Evaluation of this system's ability to predict source selections showed more promising results for the experience factor than for expertise or affinity. This may be attributed to the greater demands these two factors place in terms of input data. Limitations of the work and opportunities for future research are discussed.
Managing Social Overlay Networks in Semantic Open Enterprise Systems
"... Cross-enterprise collaboration has emerged as a key survival factor in today’s global markets. Semantic Web technologies are the basis to establish enterprise interoperability including data mediation support and automatic composition of services. Capabilities of services are semantically described ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Cross-enterprise collaboration has emerged as a key survival factor in today’s global markets. Semantic Web technologies are the basis to establish enterprise interoperability including data mediation support and automatic composition of services. Capabilities of services are semantically described andreasoningtechniquessupportthediscoveryandselection of services at run-time. These technologies are commonly based on precisely defined enterprise ontologies. In contrast to Semantic Web technologies that cover interactions between (technical) services, human collaborations emerge based on social preferences. Social networks have become a mass phenomenon. The fundamental aspects of these networks are to manage personal contacts and to share profile information with friends. These principles are increasingly harnessed in businesses and professional environments. In a manner similar to service-oriented systems, they enable flexible discovery and dynamic collaborations between participants. In this paper, we discuss the concept of social overlays for Web service based collaboration infrastructures. This mechanism enables information flows between actors in order to allow for flexible group formations in highly dynamic large-scale networks.
TRUSTED INFORMATION SHARING USING SOA-BASED SOCIAL OVERLAY NETWORKS
"... Cross-enterprise collaboration has emerged as a key survival factor in today’s global markets. Semantic Web technologies are the basis to establish enterprise interoperability including data mediation support and automatic composition of services. Capabilities of services are semantically described ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Cross-enterprise collaboration has emerged as a key survival factor in today’s global markets. Semantic Web technologies are the basis to establish enterprise interoperability including data mediation support and automatic composition of services. Capabilities of services are semantically described and reasoning techniques support the discovery and selection of services at run-time. In contrast to Semantic Web technologies that cover interactions between (technical) services, human collaboration emerges based on social preferences. Social networks have become a mass phenomenon and are increasingly used in businesses and professional environments. In a manner similar to service-oriented systems, they enable flexible discovery and dynamic collaboration between participants. In this paper, we discuss the concept of social overlays for Web service based collaboration infrastructures. This mechanism enables information flows between actors in order to allow for flexible group formation in highly dynamic large-scale networks. We present the implementation of a trusted information sharing framework and demonstrate how people adaptively share information according to the strength of social relations using SOA concepts. We evaluate technical concepts with in-depth experiments.
I.: Hashing of RDF graphs and a solution to the blank node problem
- In: Proceedings of the 10th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW), Riva del Garda, Italy. CEUR-WS.org
, 2014
"... Abstract. The ability to calculate hash values is fundamental for using cryptographic tools, such as digital signatures, with RDF data. Without hashing it is difficult to implement tamper-resistant attribution or prove-nance tracking, both important for establishing trust with open data. We propose ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract. The ability to calculate hash values is fundamental for using cryptographic tools, such as digital signatures, with RDF data. Without hashing it is difficult to implement tamper-resistant attribution or prove-nance tracking, both important for establishing trust with open data. We propose a novel hash function for RDF graphs, which does not require altering the contents of the graph, does not need to record additional in-formation, and does not depend on a concrete RDF syntax. We are also presenting a solution to the deterministic blank node labeling problem. 1
Topics in Knowledge Bases: Epistemic Ontologies and Secrecy-preserving Reasoning
, 2012
"... Part of the Computer Sciences Commons This Dissertation is brought to you for free and open access by the Graduate College at Digital Repository @ Iowa State University. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Digital Repository @ Iow ..."
Abstract
- Add to MetaCart
(Show Context)
Part of the Computer Sciences Commons This Dissertation is brought to you for free and open access by the Graduate College at Digital Repository @ Iowa State University. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Digital Repository @ Iowa State University. For more information, please contact
Secrecy-Preserving Reasoning Over Entailment Systems: Theory and Applications
, 2008
"... Privacy, copyright, security and other concerns make it essential for many distributed web applications to support selective sharing of information while, at the same time, protecting sensitive knowledge. Secrecy-preserving reasoning refers to the answering of queries against a knowledge base involv ..."
Abstract
- Add to MetaCart
(Show Context)
Privacy, copyright, security and other concerns make it essential for many distributed web applications to support selective sharing of information while, at the same time, protecting sensitive knowledge. Secrecy-preserving reasoning refers to the answering of queries against a knowledge base involving inference that uses sensitive knowledge without revealing it. We present a general framework for secrecy-preserving reasoning over arbitrary entailment systems. This framework enables reasoning with hierarchical ontologies, propo-sitional logic knowledge bases (over arbitrary logics) and RDFS knowledge bases containing sensitive in-formation that needs to be protected. We provide an algorithm that, given a knowledge base over an ef-fectively enumerable entailment system, and a secrecy set over it, defines a maximally informative secrecy-preserving reasoner. Secrecy-preserving mappings be-tween knowledge bases that allow reusing reasoners across knowledge bases are introduced.