{"title":"查询DAS模型中的加密字符数据","authors":"Nian Liu, Yajian Zhou, Xinxin Niu, Yixian Yang","doi":"10.1109/ICNDS.2010.5479313","DOIUrl":null,"url":null,"abstract":"There has been increasing concern about Databaseas-a-Service(DAS) architectures. In the DAS model, the conventional scheme for query over encrypted data in database is to construct efficient index in database. This can ensure query efficiency. However, the fuzzy search is often used in the query of character data. It will be very tough owing to data encryption. Even the tiny changes of plaintext, the ciphtext will be quite distinct. Therefore, it is crucial to construct efficient index of encrypted character strings. To address these problems, a cryptographic scheme of character data in relational database is proposed in this paper. In this scheme, the char or varchar data type and clob data type will be considered respectively. For the data of char or varchar type, an index based double filtration is established. The index includes two parts: the first part of index is used to determine the set of existed characters in original string, and the second part stores the characteristic value of the characters' positions. The first part of index implements the first filtration, which will filter all the records include inaccurate characters. The second part of index is used to verify the positions of character strings. It's the second filtration. For the data of clob type, instead of the original character data, the positions of all the character strings will be stored. This scheme avoids needless decryption and data transfer. Consequently, better query efficiency is achieved and fuzzy search is well supported.","PeriodicalId":403283,"journal":{"name":"2010 International Conference on Networking and Digital Society","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Querying encrypted character data in DAS model\",\"authors\":\"Nian Liu, Yajian Zhou, Xinxin Niu, Yixian Yang\",\"doi\":\"10.1109/ICNDS.2010.5479313\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There has been increasing concern about Databaseas-a-Service(DAS) architectures. In the DAS model, the conventional scheme for query over encrypted data in database is to construct efficient index in database. This can ensure query efficiency. However, the fuzzy search is often used in the query of character data. It will be very tough owing to data encryption. Even the tiny changes of plaintext, the ciphtext will be quite distinct. Therefore, it is crucial to construct efficient index of encrypted character strings. To address these problems, a cryptographic scheme of character data in relational database is proposed in this paper. In this scheme, the char or varchar data type and clob data type will be considered respectively. For the data of char or varchar type, an index based double filtration is established. The index includes two parts: the first part of index is used to determine the set of existed characters in original string, and the second part stores the characteristic value of the characters' positions. The first part of index implements the first filtration, which will filter all the records include inaccurate characters. The second part of index is used to verify the positions of character strings. It's the second filtration. For the data of clob type, instead of the original character data, the positions of all the character strings will be stored. This scheme avoids needless decryption and data transfer. Consequently, better query efficiency is achieved and fuzzy search is well supported.\",\"PeriodicalId\":403283,\"journal\":{\"name\":\"2010 International Conference on Networking and Digital Society\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Networking and Digital Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNDS.2010.5479313\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Networking and Digital Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNDS.2010.5479313","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
There has been increasing concern about Databaseas-a-Service(DAS) architectures. In the DAS model, the conventional scheme for query over encrypted data in database is to construct efficient index in database. This can ensure query efficiency. However, the fuzzy search is often used in the query of character data. It will be very tough owing to data encryption. Even the tiny changes of plaintext, the ciphtext will be quite distinct. Therefore, it is crucial to construct efficient index of encrypted character strings. To address these problems, a cryptographic scheme of character data in relational database is proposed in this paper. In this scheme, the char or varchar data type and clob data type will be considered respectively. For the data of char or varchar type, an index based double filtration is established. The index includes two parts: the first part of index is used to determine the set of existed characters in original string, and the second part stores the characteristic value of the characters' positions. The first part of index implements the first filtration, which will filter all the records include inaccurate characters. The second part of index is used to verify the positions of character strings. It's the second filtration. For the data of clob type, instead of the original character data, the positions of all the character strings will be stored. This scheme avoids needless decryption and data transfer. Consequently, better query efficiency is achieved and fuzzy search is well supported.