Longest Common Sub-sequence Computation and Retrieve for Encrypted Character Strings | |
Zhao, Minghao; Li, Zhen; Wang, Yilei; Xu, Qiuliang | |
2016 | |
会议名称 | 19th International Conference on Network-Based Information Systems (NBiS) |
会议日期 | SEP 07-09, 2016 |
关键词 | homomorphic encryption information retrieve longest Common Sub-sequence searchable encryption |
DOI | 10.1109/NBiS.2016.82 |
页码 | 496-499 |
收录类别 | CPCI-S |
会议录 | PROCEEDINGS OF 2016 19TH INTERNATIONAL CONFERENCE ON NETWORK-BASED INFORMATION SYSTEMS (NBIS) |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/6033720 |
专题 | 山东大学 |
作者单位 | 1.Shandong Univ, Sch Comp Sci & Technol, Jinan, Peoples R China. 2.Shandong Univ Finance & Econ, Sch |
推荐引用方式 GB/T 7714 | Zhao, Minghao,Li, Zhen,Wang, Yilei,et al. Longest Common Sub-sequence Computation and Retrieve for Encrypted Character Strings[C]. 见:19th International Conference on Network-Based Information Systems (NBiS). SEP 07-09, 2016. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论