Computational Secure ORAM (COMP SE-ORAM) with (ω)over-tilde(log n) overhead

被引:0
|
作者
Mbelli, Thierry Mbah [1 ]
机构
[1] First Natl Bank, Johannesburg, South Africa
关键词
Cloud security; Oblivious RAM; Privacy; Amazon S3; Random Access Location;
D O I
10.1109/CloudSummit47114.2019.00022
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Oblivious RAM (ORAM) is a strong-provable secured approach to accessing cloud stored objects. Many ORAM models have been proposed to improve storage, communication and privacy efficiency of the ORAM constructions with no much attention paid to a holistic approach to the oblivious cloud storage security. Statically secure ORAM models generally have the security overhead of (omega) over tilde (log (2)n) where n is the memory size. This paper proposes an ORAM model with computational security overhead of (omega) over tilde (log n) using Amazon Simple Storage (Amazon S3) as a storage model. Another benefit of this proposed model is its conceptual simplicity at implementation. The construction of this model is based on the ORAM model proposed by Kai-Min Chung, Zhenming Liu and Rafael Pass. The crucial ramification of this model is to reduce the overhead from (omega) over tilde (log (2)n) to (omega) over tilde (log n). Using the Amazon S3, security analysis was conducted with the result incurring.(log n) security overhead. This is achieved by randomizing the location of the storage node.
引用
收藏
页码:99 / 102
页数:4
相关论文
共 4 条
  • [1] Statistically-secure ORAM with (O)over-tilde (log2 n) Overhead
    Chung, Kai-Min
    Liu, Zhenming
    Pass, Rafael
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2014, PT II, 2014, 8874 : 62 - 81
  • [2] NanoGRAM: Garbled RAM with <O)over tilde>(log N) Overhead
    Park, Andrew
    Lin, Wei-Kai
    Shi, Elaine
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT I, 2023, 14004 : 456 - 486
  • [3] O(√log n) approximation to SPARSEST CUT in (O)over-tilde(n2) time
    Arora, S
    Hazan, E
    Kale, S
    45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 238 - 247
  • [4] Dynamic Bridge-Finding in (O)over-tilde(log2 n) Amortized Time
    Holm, Jacob
    Rotenberg, Eva
    Thorup, Mikkel
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 35 - 52