加密RDF-Graph的可能性

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications Pub Date : 2008-04-07 DOI:10.1109/ICTTA.2008.4530288

Sabrina Gerbracht

{"title":"加密RDF-Graph的可能性","authors":"Sabrina Gerbracht","doi":"10.1109/ICTTA.2008.4530288","DOIUrl":null,"url":null,"abstract":"In this paper different approaches on achieving privacy protection in RDF graphs are discussed. Mainly this means encryption of elements and subgraphs of an RDF graph. Existing solutions have the disadvantage, that along 'with the encryption many new statements have to be generated, 'what results in a rapidly growing graph. By combining different approaches, these disadvantages can be eliminated. The result 'will be an elegant possibility to encrypt parts of an RDF graph, 'without increasing the 'whole RDF graph unnecessarily.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Possibilities to Encrypt an RDF-Graph\",\"authors\":\"Sabrina Gerbracht\",\"doi\":\"10.1109/ICTTA.2008.4530288\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper different approaches on achieving privacy protection in RDF graphs are discussed. Mainly this means encryption of elements and subgraphs of an RDF graph. Existing solutions have the disadvantage, that along 'with the encryption many new statements have to be generated, 'what results in a rapidly growing graph. By combining different approaches, these disadvantages can be eliminated. The result 'will be an elegant possibility to encrypt parts of an RDF graph, 'without increasing the 'whole RDF graph unnecessarily.\",\"PeriodicalId\":330215,\"journal\":{\"name\":\"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTTA.2008.4530288\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTTA.2008.4530288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

本文讨论了在RDF图中实现隐私保护的不同方法。这主要意味着对RDF图的元素和子图进行加密。现有的解决方案有一个缺点，即在加密的同时必须生成许多新的语句，这将导致一个快速增长的图。通过结合不同的方法，可以消除这些缺点。其结果“将是一种对RDF图的部分进行加密的优雅可能性”，而不会不必要地增加“整个RDF图”。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Possibilities to Encrypt an RDF-Graph

In this paper different approaches on achieving privacy protection in RDF graphs are discussed. Mainly this means encryption of elements and subgraphs of an RDF graph. Existing solutions have the disadvantage, that along 'with the encryption many new statements have to be generated, 'what results in a rapidly growing graph. By combining different approaches, these disadvantages can be eliminated. The result 'will be an elegant possibility to encrypt parts of an RDF graph, 'without increasing the 'whole RDF graph unnecessarily.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications

自引率

0.00%

发文量