.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
This study examines the ordered bucketization (OB) as a cryptographic object. In OB, plaintextspace is divided into p disjoint buckets, numbered from 1 to p, based on the order of the ranges that they cover. OB is quite useful in that a range query can be performed over encrypted data without the need to decrypt by attaching a bucket number to each ciphertext. Unfortunately, no research has been carried out on the security of OB in a cryptographic sense. This paper defines an encryption scheme with OB (EOB) and suggests a new security model for EOB, IND-OCPA-P, which assumes an adversary has reasonable power. Previous constructions proposed for efficient range queries [5], [6], [14] were not secure in this model. Finally, an OB construction, in which the EOB implementation is secure on the IND-OCPA-P model, is proposed. In the proposed OB, p-1 points are selected on the uniform distribution in the plaintext-space and the plaintext-space is divided based on the selected points. A bucket number is assigned to each divided range in ascending range order. With regard to the efficiency of a range query, the proposed OB guarantees reasonably good efficiency on range queries by showing that the distribution of a bucket size is not skewed.
Keyword:
Searchable encryption
symmetric encryption
data encryption
database security
security
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.4K
被引数:
9.6K
机构
暂无机构信息
引用论文
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
查看更多内容