隐藏树形结构数据和来自不可信数据存储的查询

Q4 Social Sciences
Ping-Min Lin, K. Candan
{"title":"隐藏树形结构数据和来自不可信数据存储的查询","authors":"Ping-Min Lin, K. Candan","doi":"10.1201/1086.1065898X/45528.14.4.20050901/90085.3","DOIUrl":null,"url":null,"abstract":"Abstract With the increasing use of Web services, many new challenges concerning data security are becoming critical. Especially in mobile services, where clients are generally thin in terms of computation power and storage space, a remote server can be outsourced for the computation or can act as a data store. Unfortunately, such a data store may not always be trustworthy, and clients with sensitive data and queries may want protection from malicious attacks. This article presents a technique to hide tree-structured data from potentially malicious data stores, while allowing clients to traverse the data to locate an object of interest without leaking information to the data store. The two motivating applications for this approach are hiding (1) tree-like XML data as well as XML queries that are in the form of tree-paths, and (2) tree-structured indexes and queries executed on such data structures. We show that this task is achievable through a one-server protocol that introduces only a limited and adjustable communication overhead. This is especially essential in low-bandwidth (such as wireless) distributed environments. The proposed protocol has desirable communication and concurrency performance, as demonstrated by the experiments we have conducted.","PeriodicalId":36738,"journal":{"name":"Journal of Information Systems Security","volume":"93 1","pages":"10 - 26"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Hiding Tree Structured Data and Queries from Untrusted Data Stores\",\"authors\":\"Ping-Min Lin, K. Candan\",\"doi\":\"10.1201/1086.1065898X/45528.14.4.20050901/90085.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract With the increasing use of Web services, many new challenges concerning data security are becoming critical. Especially in mobile services, where clients are generally thin in terms of computation power and storage space, a remote server can be outsourced for the computation or can act as a data store. Unfortunately, such a data store may not always be trustworthy, and clients with sensitive data and queries may want protection from malicious attacks. This article presents a technique to hide tree-structured data from potentially malicious data stores, while allowing clients to traverse the data to locate an object of interest without leaking information to the data store. The two motivating applications for this approach are hiding (1) tree-like XML data as well as XML queries that are in the form of tree-paths, and (2) tree-structured indexes and queries executed on such data structures. We show that this task is achievable through a one-server protocol that introduces only a limited and adjustable communication overhead. This is especially essential in low-bandwidth (such as wireless) distributed environments. The proposed protocol has desirable communication and concurrency performance, as demonstrated by the experiments we have conducted.\",\"PeriodicalId\":36738,\"journal\":{\"name\":\"Journal of Information Systems Security\",\"volume\":\"93 1\",\"pages\":\"10 - 26\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Systems Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/1086.1065898X/45528.14.4.20050901/90085.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Social Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Systems Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/1086.1065898X/45528.14.4.20050901/90085.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 8

摘要

随着Web服务应用的日益广泛,数据安全面临着许多新的挑战。特别是在移动服务中,客户机在计算能力和存储空间方面通常很薄弱,因此可以将远程服务器外包出去进行计算或充当数据存储。不幸的是,这样的数据存储可能并不总是值得信赖的,并且具有敏感数据和查询的客户端可能需要保护以防止恶意攻击。本文介绍了一种技术,可以对潜在的恶意数据存储隐藏树结构数据,同时允许客户机遍历数据以定位感兴趣的对象,而不会将信息泄露给数据存储。这种方法的两个驱动应用程序是隐藏(1)树状XML数据以及树路径形式的XML查询,以及(2)树状结构的索引和在这些数据结构上执行的查询。我们展示了通过单服务器协议可以实现此任务,该协议只引入有限且可调整的通信开销。这在低带宽(如无线)分布式环境中尤其重要。实验结果表明,该协议具有良好的通信性能和并发性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hiding Tree Structured Data and Queries from Untrusted Data Stores
Abstract With the increasing use of Web services, many new challenges concerning data security are becoming critical. Especially in mobile services, where clients are generally thin in terms of computation power and storage space, a remote server can be outsourced for the computation or can act as a data store. Unfortunately, such a data store may not always be trustworthy, and clients with sensitive data and queries may want protection from malicious attacks. This article presents a technique to hide tree-structured data from potentially malicious data stores, while allowing clients to traverse the data to locate an object of interest without leaking information to the data store. The two motivating applications for this approach are hiding (1) tree-like XML data as well as XML queries that are in the form of tree-paths, and (2) tree-structured indexes and queries executed on such data structures. We show that this task is achievable through a one-server protocol that introduces only a limited and adjustable communication overhead. This is especially essential in low-bandwidth (such as wireless) distributed environments. The proposed protocol has desirable communication and concurrency performance, as demonstrated by the experiments we have conducted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Information Systems Security
Journal of Information Systems Security Social Sciences-Safety Research
CiteScore
0.40
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信