.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Comparable encryption
Sliding window method
Security
Efficiency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
ShareSave
ShareSaveShareSaveFrequency of Screening and SBT Technique Trial - North American Weaning Collaboration (FAST-NAWC): a protocol for a multicenter, factorial randomized trial.png)
Trials
OAAI
TrialsIF0
OAAIShareSave
View more