Paper Info
Title
TSKT-ORAM: A two-server k-ary tree ORAM for access pattern protection in cloud storage.
Abstract
This paper proposes TSKT-ORAM, a two-server k-ary tree-based Oblivious RAM construction, to hide a client's access pattern to outsourced data. TSKT-ORAM is proved to hide the access pattern with a failure probability of 2(-lambda), where k = logN (N is the number of outsourced data items) and lambda is a security parameter. Under the same configuration, TSKT-ORAM has an asymptotical communication cost of O(logN/log logN . B) (B is the size of a data block) if the number of recursion levels on meta data is O(1), or O( log(2) N/log logN . B) if the number of recursion levels is O(logN). Asymptotical analysis and detailed implementation-based comparisons are conducted to compare the performance of TSKT-ORAM with state-of-the-art ORAM schemes.
Year
Venue
Field
2016
IEEE Military Communications Conference
Oblivious ram,Computer science,Cryptography,K-ary tree,Binary tree,Block (data storage),Computer network,Security parameter,Recursion,Cloud storage
DocType
ISSN
Citations 
Conference
2155-7578
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Jinsheng Zhang1243.86
Qiumao Ma2123.33
Wensheng Zhang39818.14
Daji Qiao41305142.62