保护隐私的SQL查询

Hyun-A. Park, J. Zhan, Dong Hoon Lee
{"title":"保护隐私的SQL查询","authors":"Hyun-A. Park, J. Zhan, Dong Hoon Lee","doi":"10.1109/ISA.2008.40","DOIUrl":null,"url":null,"abstract":"One of the most substantial ways to protect sensitive information is encryption of data. However, the cryptographic method brings in some problems such as inefficiency and malfunctioning, especially impossibility of arithmetic. The previous works in this area have been proved insecure or can provide only a few or several SQL queries. Actually, there is no scheme which can support secure all kinds of SQL queries and arithmetic. We propose a novel scheme to solve this problem. We do not encrypt every data itself but permute all the data within each attribute so that we can break the relation of the data and the owner. Accordingly, the proposed scheme guarantees intractability of re-identification for data-owners' privacy and at the same time enables the miner to get the information he wants.","PeriodicalId":212375,"journal":{"name":"2008 International Conference on Information Security and Assurance (isa 2008)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Privacy Preserving SQL Queries\",\"authors\":\"Hyun-A. Park, J. Zhan, Dong Hoon Lee\",\"doi\":\"10.1109/ISA.2008.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most substantial ways to protect sensitive information is encryption of data. However, the cryptographic method brings in some problems such as inefficiency and malfunctioning, especially impossibility of arithmetic. The previous works in this area have been proved insecure or can provide only a few or several SQL queries. Actually, there is no scheme which can support secure all kinds of SQL queries and arithmetic. We propose a novel scheme to solve this problem. We do not encrypt every data itself but permute all the data within each attribute so that we can break the relation of the data and the owner. Accordingly, the proposed scheme guarantees intractability of re-identification for data-owners' privacy and at the same time enables the miner to get the information he wants.\",\"PeriodicalId\":212375,\"journal\":{\"name\":\"2008 International Conference on Information Security and Assurance (isa 2008)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Information Security and Assurance (isa 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISA.2008.40\",\"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 International Conference on Information Security and Assurance (isa 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISA.2008.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

保护敏感信息最重要的方法之一是数据加密。但是,加密方法存在效率低、故障多、特别是算法不可行等问题。该领域以前的工作已被证明是不安全的,或者只能提供几个或几个SQL查询。实际上,目前还没有一种方案能够安全支持各种SQL查询和运算。我们提出了一个解决这个问题的新方案。我们不加密每个数据本身,而是对每个属性中的所有数据进行排列,这样我们就可以打破数据与所有者的关系。因此,该方案保证了数据所有者隐私的难以再识别性,同时使矿工能够获得他想要的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Privacy Preserving SQL Queries
One of the most substantial ways to protect sensitive information is encryption of data. However, the cryptographic method brings in some problems such as inefficiency and malfunctioning, especially impossibility of arithmetic. The previous works in this area have been proved insecure or can provide only a few or several SQL queries. Actually, there is no scheme which can support secure all kinds of SQL queries and arithmetic. We propose a novel scheme to solve this problem. We do not encrypt every data itself but permute all the data within each attribute so that we can break the relation of the data and the owner. Accordingly, the proposed scheme guarantees intractability of re-identification for data-owners' privacy and at the same time enables the miner to get the information he wants.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信