TSKT-ORAM: A Two-Server k-ary Tree Oblivious RAM without Homomorphic Encryption
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 t...
Main Authors: | Jinsheng Zhang, Qiumao Ma, Wensheng Zhang, Daji Qiao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-09-01
|
Series: | Future Internet |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-5903/9/4/57 |
Similar Items
-
Octopus ORAM: An Oblivious RAM with Communication and Server Storage Efficiency
by: Qiumao Ma, et al.
Published: (2019-04-01) -
SqORAM: Read-Optimized Sequential Write-Only Oblivious RAM
by: Chakraborti Anrin, et al.
Published: (2020-01-01) -
FedORAM: A Federated Oblivious RAM Scheme
by: Alexandre Pujol, et al.
Published: (2020-01-01) -
Externally Verifiable Oblivious RAM
by: Gancher Joshua, et al.
Published: (2017-04-01) -
Flat ORAM: A Simplified Write-Only Oblivious RAM Construction for Secure Processors
by: Syed Kamran Haider, et al.
Published: (2019-03-01)