IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v9y2017i4p57-d113446.html
   My bibliography  Save this article

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

Author

Listed:
  • Jinsheng Zhang

    (Department of Computer Science, Iowa State University, Ames, IA 50011, USA)

  • Qiumao Ma

    (Department of Computer Science, Iowa State University, Ames, IA 50011, USA)

  • Wensheng Zhang

    (Department of Computer Science, Iowa State University, Ames, IA 50011, USA)

  • Daji Qiao

    (Department of Electric and Computer Engineering, Iowa State University, Ames, IA 50011, USA)

Abstract

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.

Suggested Citation

  • Jinsheng Zhang & Qiumao Ma & Wensheng Zhang & Daji Qiao, 2017. "TSKT-ORAM: A Two-Server k -ary Tree Oblivious RAM without Homomorphic Encryption," Future Internet, MDPI, vol. 9(4), pages 1-22, September.
    • Handle: RePEc:gam:jftint:v:9:y:2017:i:4:p:57-:d:113446
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/9/4/57/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/9/4/57/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:9:y:2017:i:4:p:57-:d:113446. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.