.png){kind=icon}
返回
Efficient request-based comparable encryption scheme based on sliding window method
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1766-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present an efficient request-based comparable encryption, which is based on sliding window techniques. Recently, Furukawa (Computer security-ESORICS 2013, Springer, 129-146, 2013) introduced a new primitive called request-based comparable encryption (comparable encryption for short) which overcomes the problem that OPEs cannot solve. OPEs have the problem that when all the numbers in a certain domain are encrypted by an OPE, an attacker can easily obtain all the orders of the encrypted numbers and hence retrieve the original numbers. However, comparable encryption is not efficient enough both in storage and in computation workload. Comparable encryption based on sliding window method Ko double dagger in Comput Math Appl 30:17-24, 1995 can adaptively adjust the window size to achieve a high performance. We set the window size as a constant number to conveniently generate ciphertexts and compare with others. Besides, the proposed scheme allows the users to obtain a variable trade-off between security and efficiency through adaptively setting the window size.
Keyword:
Comparable encryption
Sliding window method
Security
Efficiency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
A Semi-Lagrangian Godunov-Type Method without Numerical Viscosity for Shocks一种无数值粘性的半拉格朗日戈杜诺夫型激波方法.png)
Fluids
OAAI
FluidsIF0
OAAI分享收藏Frequency of Screening and SBT Technique Trial - North American Weaning Collaboration (FAST-NAWC): a protocol for a multicenter, factorial randomized trialTrials
OAAI
TrialsIF0
OAAI分享收藏
查看更多内容