标题:Longest Common Sub-sequence Computation and Retrieve for Encrypted Character Strings
作者:Zhao, Minghao ;Li, Zhen ;Wang, Yilei ;Xu, Qiuliang
作者机构:[Zhao, Minghao ;Li, Zhen ;Xu, Qiuliang ] School of Computer Science and Technology, Shandong University, Jinan, China;[Wang, Yilei ] School of Informa 更多
会议名称:19th International Conference on Network-Based Information Systems, NBiS 2016
会议日期:7 September 2016 through 9 September 2016
来源:NBiS 2016 - 19th International Conference on Network-Based Information Systems
出版年:2016
页码:496-499
DOI:10.1109/NBiS.2016.82
关键词:homomorphic encryption; information retrieve; longest Common Sub-sequence; Searchable encryption
摘要:Longest Common Sub-sequence is a basic algorithm problem. It serves as a basic component for a variety of applications in information processing and bioinformatics. It is a NP-hard problem and often manipulated using dynamic programming, which is relatively fast but involves large memory space. Fortunately, cloud computing and outsourced computing provides a practical method for overload alleviation. However, for the security and privacy concern, clients hope to encrypt their data before upload them to the cloud, meanwhile maintain the ability for the cloud to process on the data. In this paper, we propose a method to computing Longest Common Sub-sequence using somewhat homomorphic encryption. Beyond that, we show how to use our achievement into searchable encryption to achieve rich expressiveness. © 2016 IEEE.
收录类别:EI;SCOPUS
Scopus被引频次:1
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85011016218&doi=10.1109%2fNBiS.2016.82&partnerID=40&md5=6a0a6863f436d49e1965e375341f86bf
TOP