 |
|
|
|
 |
 |
 |
|
 |
|
 |
|
|
| 孙晓妮,蒋瀚,徐秋亮.基于二叉树存储的多用户ORAM方案.软件学报,2016,27(6):1475-1486 |
| 基于二叉树存储的多用户ORAM方案 |
| Multi-User Binary Tree Based ORAM Scheme |
| 投稿时间：2015-08-15 修订日期：2015-10-09 |
| DOI：10.13328/j.cnki.jos.005002 |
| 中文关键词: 云计算 二叉树 不经意随机存取 多用户 访问模式 |
| 英文关键词:cloud computing binary tree oblivious random access memory multi-user access pattern |
| 基金项目:国家自然科学基金(61173139,61572294);教育部博士点基金(20110131110027) |
|
| 摘要点击次数: 3970 |
| 全文下载次数: 2439 |
| 中文摘要: |
| 随着大数据及数据挖掘技术的发展,云计算环境中用户访问模式成为泄露用户隐私的一条途径.不经意随机存取技术(ORAM)是保护用户访问模式的一条有效途径.现有的ORAM方案中,大部分只支持单个用户,而唯一支持多用户的ORAM方案是基于分层ORAM方案设计的,但其混淆过程的计算复杂度高.为了避免出现混淆过程,在基于二叉树ORAM方案的基础上,构造了一个多用户的ORAM方案.首先,改进了一个代理加密方案,然后在多个用户和服务器之间引入一个代理,利用改进的代理加密机制,将不同用户加密的数据,通过代理再次加密成相同密钥加密的数据存储到服务器.该方案的安全性基于伪随机函数的不可区分性,其最差情况下的计算复杂度和平均计算复杂度均为O(log2n),比现有的多用户ORAM方案的效率要高. |
| 英文摘要: |
| With the development of big data and data mining technology, the access pattern becomes a risk of leaking user's privacy in the cloud computing environment. Oblivious random access memory (ORAM) is an effective way to protect the user's access pattern. The existing ORAMs mostly support a single user. The only ORAM supporting multi-user is based on the hierarchical ORAM including a reshuffling phase that may cause high computational complexity. In order to avoid reshuffling, this paper designs a new multi-user ORAM based on binary tree. First, a proxy encryption scheme is improved. Second, a proxy between users and the cloud server is introduced. The data encrypted by different users is encrypted again by the proxy to obtain the final ciphertext encrypted by the same key, and the final ciphertext is stored on the server. The security of the scheme is based on the indistinguishability of the pseudorandom function, and the worst computational complexity and the amortized computational complexity are all O(log2n), achieving higher efficiency than the existing multi-user ORAM schemes. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
|
|
|
|
|
|
 |
|
|
|
|
 |
|
 |
|
 |
|
