标题:Efficient ORAM Based on Binary Tree without Data Overflow and Evictions
作者:Li, Shufeng; Zhao, Minghao; Jiang, Han; Xu, Qiuliang; Wei, Xiaochao
通讯作者:Jiang, Han
作者机构:[Li, Shufeng; Zhao, Minghao; Jiang, Han; Xu, Qiuliang; Wei, Xiaochao] Shandong Univ, Sch Comp Sci & Technol, Jinan 250100, Peoples R China.
会议名称:7th International Symposium on Intelligence Computation and Applications (ISICA)
会议日期:NOV 21-22, 2015
来源:COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS, (ISICA 2015)
出版年:2016
卷:575
页码:596-607
DOI:10.1007/978-981-10-0356-1_62
关键词:ORAM; Storage security; Binary-tree; Access patterns protection
摘要:ORAM is a useful primitive that allows a client to hide its data access pattern and ORAM technique as a wide range of applications nowadays. In this paper, we propose a verified version of binary-tree-based ORAM with less data access overhead. We provide a new method to reselect the leaf node and write data back to the tree, and accordingly, avoid complicated evict operation. Besides, the bucket capacity is reduced to a constant level. Overall, our scheme improves the efficiency meanwhile maintains security requirement of ORAM.
收录类别:CPCI-S;EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84957966665&doi=10.1007%2f978-981-10-0356-1_62&partnerID=40&md5=c8c8e855ca6795b3013687d306a81713
TOP