A New Efficient Request-Based Comparable Encryption Scheme

sciencepaper_online

引用 0|浏览0
暂无评分
摘要
Abstract: Privacy-preserving comparisons over encrypted entries of a database is a hot topic in academic research. Although order preserving encryption (OPE) basically achieves this target, when all the numbers in a certain scope are encrypted by an OPE, an attacker can retrieve the original numbers from their order. Furukawa puts forth a novel digit number encryption method called request-based comparable encryption (comparable encryption for short). but the disadvantages is that the token and cipher generations are inefficient. In this paper, we propose a new scheme based on comparable encryption by using sliding window method, which performs better than original comparable encryption both in storage and in computation workload. In our scheme, the users can obtain a trade-off between security and efficiency through adaptively setting the window size according to their real scenario.
更多
查看译文
关键词
Comparable Encryption, Sliding Window, Security, Efficiency.
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要