| 摘要: |
| 随着云计算的深入发展,隐私安全成为云安全的一个关键问题.加密是一种常用的保护敏感数据的方法,但是它不支持有效的数据操作.为了提供云计算环境中的隐私保护,设计了一种随机数据结构——随机树,并构建了基于随机树的保序加密算法OPEART(order-preserving encryption based on random tree).OPEART通过引入随机性实现了对数据的加密,并支持加密数据的任何关系运算(>,<,>=等).安全分析和性能评估表明:OPEART是IND- DNCPA(indistinguishability under distinct and neighbouring chosen plaintext attack)安全的,并能高效地实现对加密数据的关系运算. |
| 关键词: 云计算 隐私安全 保序加密 关系运算 |
| DOI：10.13328/j.cnki.jos.004656 |
| 分类号: |
| 基金项目:国家自然科学基金(61063012, 61363003); 教育部高等学校博士学科点专项科研基金(20120201110013); 广西自然科学基金(2013GXNSFBA019281, 2012GXNSFAA053222); 广西科学研究与技术开发计划(桂科攻1348020-7); 广西教育厅科研基金(2013YB007); 广西大学科研基金(XBZ120257); 陕西省科技攻关项目(2012K06-30) |
|
| Encryption Algorithm Supporting Relational Calculations in Cloud Computing |
|
HUANG Ru-Wei1,2, GUI Xiao-Lin1, CHEN Ning-Jiang2, YAO Jing1
|
|
1.School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an 710049, China;2.School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China
|
| Abstract: |
| With the development of cloud computing, privacy has become the key problem of cloud security. While encryption is a well-established technology for protecting sensitive data, it makes effective data utilization a very challenging task. To solve the problem, this paper designs a randomized data structure—random tree (RT), and constructs an encryption scheme OPEART (order-preserving encryption algorithm based on RT). OPEART realizes the encryption of data by randomness, and supports relational calculations (>, <, >=, etc.) on encrypted data. Security analysis and performance evaluation show that OPEART is IND-DNCPA while achieving the goal of relational calculations on encrypted cloud data efficiently. |
| Key words: cloud computing privacy security order-preserving encryption relational calculation |
