Next Article in Journal / Special Issue
Extensions and Enhancements to “the Secure Remote Update Protocol”
Previous Article in Journal / Special Issue
Review on Semi-Fragile Watermarking Algorithms for Content Authentication of Digital Images
Article

TSKT-ORAM: A Two-Server k-ary Tree Oblivious RAM without Homomorphic Encryption

1
Department of Computer Science, Iowa State University, Ames, IA 50011, USA
2
Department of Electric and Computer Engineering, Iowa State University, Ames, IA 50011, USA
*
Author to whom correspondence should be addressed.
The Proceedings of the IEEE Conference on Military Communications, Cyber Security Track, Baltimore, MD, USA, 1–3 November 2016.
Future Internet 2017, 9(4), 57; https://doi.org/10.3390/fi9040057
Received: 24 August 2017 / Revised: 21 September 2017 / Accepted: 24 September 2017 / Published: 27 September 2017
(This article belongs to the Collection Information Systems Security)
This paper proposes TSKT-oblivious RAM (ORAM), an efficient multi-server ORAM construction, to protect a client’s access pattern to outsourced data. TSKT-ORAM organizes each of the server storages as a k-ary tree and adopts XOR-based private information retrieval (PIR) and a novel delayed eviction technique to optimize both the data query and data eviction process. TSKT-ORAM is proven to protect the data access pattern privacy with a failure probability of 2 - 80 when system parameter k 128 . Meanwhile, given a constant-size local storage, when N (i.e., the total number of outsourced data blocks) ranges from 2 16 2 34 , the communication cost of TSKT-ORAM is only 22–46 data blocks. Asymptotic analysis and practical comparisons are conducted to show that TSKT-ORAM incurs lower communication cost, storage cost and access delay in practical scenarios than the compared state-of-the-art ORAM schemes. View Full-Text
Keywords: cloud computing; storage; access pattern protection; oblivious RAM cloud computing; storage; access pattern protection; oblivious RAM
Show Figures

Figure 1

MDPI and ACS Style

Zhang, J.; Ma, Q.; Zhang, W.; Qiao, D. TSKT-ORAM: A Two-Server k-ary Tree Oblivious RAM without Homomorphic Encryption. Future Internet 2017, 9, 57. https://doi.org/10.3390/fi9040057

AMA Style

Zhang J, Ma Q, Zhang W, Qiao D. TSKT-ORAM: A Two-Server k-ary Tree Oblivious RAM without Homomorphic Encryption. Future Internet. 2017; 9(4):57. https://doi.org/10.3390/fi9040057

Chicago/Turabian Style

Zhang, Jinsheng, Qiumao Ma, Wensheng Zhang, and Daji Qiao. 2017. "TSKT-ORAM: A Two-Server k-ary Tree Oblivious RAM without Homomorphic Encryption" Future Internet 9, no. 4: 57. https://doi.org/10.3390/fi9040057

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop