HOPE: Homomorphic Order-Preserving Encryption for Outsourced Databases -- A Stateless Approach

同态加密 无状态协议 计算机科学 订单(交换) 加密 数据库 计算机安全 万维网 理论计算机科学 业务 财务 网络数据包
作者
Baocang Wang,Dongfang Zhao
出处
期刊:Cornell University - arXiv
标识
DOI:10.48550/arxiv.2411.17009
摘要

Order-preserving encryption (OPE) is a fundamental cryptographic tool for enabling efficient range queries on encrypted data in outsourced databases. Despite its importance, existing OPE schemes face critical limitations that hinder their practicality. Stateful designs require clients to maintain plaintext-to-ciphertext mappings, imposing significant storage and management overhead. Stateless designs often rely on interactive protocols between the client and server, leading to high communication latency and limited scalability. These limitations make existing schemes unsuitable for real-world applications that demand simplicity, efficiency, and scalability. In this work, we present Homomorphic OPE (HOPE), a new OPE scheme that eliminates client-side storage and avoids additional client-server interaction during query execution. HOPE leverages the additive property of homomorphic encryption to introduce a novel comparison key mechanism, which transforms ciphertext comparison into a randomized difference computation. This mechanism ensures that only the sign of the comparison is preserved while fully masking the underlying plaintext values, enabling secure and efficient range queries without leaking additional information about the data. We provide a formal cryptographic analysis of HOPE, proving its security under the widely accepted IND-OCPA model. Our proofs rigorously demonstrate that the comparison key mechanism reveals no information beyond the order of the plaintexts and ensures resistance to both chosen-plaintext attacks and frequency analysis. To validate the practicality of HOPE, we conduct extensive experiments comparing it with state-of-the-art OPE schemes. The results demonstrate that HOPE achieves competitive query performance while addressing the key limitations of existing designs, making it a scalable and secure solution for outsourced database systems.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
狠毒的小龙虾完成签到,获得积分10
1秒前
小趴菜完成签到,获得积分10
5秒前
lcls完成签到,获得积分10
6秒前
6秒前
7秒前
尊敬太阳发布了新的文献求助10
9秒前
风中夜天完成签到 ,获得积分10
9秒前
优雅友蕊完成签到,获得积分10
10秒前
gaga完成签到,获得积分10
11秒前
西北孤傲的狼完成签到,获得积分10
12秒前
多边形完成签到 ,获得积分10
14秒前
李cc完成签到,获得积分10
16秒前
16秒前
快帮我找找完成签到,获得积分10
16秒前
xiezhuochun完成签到 ,获得积分10
17秒前
20秒前
aixiaoming0503完成签到,获得积分10
21秒前
forge完成签到,获得积分10
21秒前
22秒前
Distance完成签到,获得积分10
25秒前
蒋念寒发布了新的文献求助10
26秒前
雪雨夜心完成签到,获得积分10
30秒前
又是一年完成签到,获得积分10
31秒前
Distance发布了新的文献求助10
32秒前
李子完成签到 ,获得积分10
33秒前
33秒前
耍酷的指甲油完成签到,获得积分20
34秒前
安小磊完成签到 ,获得积分10
35秒前
雄i完成签到,获得积分10
38秒前
明亮的遥完成签到 ,获得积分0
40秒前
安澜完成签到,获得积分10
40秒前
MG_XSJ应助1111采纳,获得10
43秒前
尊敬太阳完成签到,获得积分20
44秒前
45秒前
量子星尘发布了新的文献求助30
46秒前
健壮安柏完成签到 ,获得积分10
47秒前
Jasper应助忧郁紫翠采纳,获得10
48秒前
48秒前
49秒前
49秒前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Handbook of Industrial Diamonds.Vol2 1100
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038184
求助须知:如何正确求助?哪些是违规求助? 3575908
关于积分的说明 11373872
捐赠科研通 3305715
什么是DOI,文献DOI怎么找? 1819255
邀请新用户注册赠送积分活动 892662
科研通“疑难数据库(出版商)”最低求助积分说明 815022