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−λ, where k = logN (N is the number of outsourced data items) and λ 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( log2 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
