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 Menu
Issue 4 (December) cover image

Export Article

Open AccessFeature PaperArticle
Future Internet 2017, 9(4), 57;

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

Department of Computer Science, Iowa State University, Ames, IA 50011, USA
Department of Electric and Computer Engineering, Iowa State University, Ames, IA 50011, USA
The Proceedings of the IEEE Conference on Military Communications, Cyber Security Track, Baltimore, MD, USA, 1–3 November 2016.
Author to whom correspondence should be addressed.
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)
Full-Text   |   PDF [400 KB, uploaded 28 September 2017]   |  


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

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

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.

Show more citation formats Show less citations formats

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

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top