File(s) not publicly available

Analysis of path ORAM toward practical utilization

conference contribution
posted on 24.07.2018, 00:00 by Steven Gordon, A Miyaji, C Su, K Sumongkayyothin
Oblivious RAM is known as a secure protocol for hiding client's access pattern from an untrusted server. However, the current ORAM algorithms still incur large computation, storage and communication overheads. For this reason, investigation of the ORAM limitations and methods to improve efficiency in real-world environments is necessary. In this paper we focus on one of the leading algorithms, Path ORAM, and propose an efficient implementation. Specifically we analyse the selection of encryption algorithms, concluding the use of AES-GCM to avoid duplication of blocks on the server. Also we propose extending Path ORM by using local caching on the client to reduce communication overhead. Experimental results from our Python implementation show key tradeoffs for ORAM design.

Funding

Other

History

Editor

Barolli L; Takizawa M; Hsu H; Enokido T; Xhafa F

Parent Title

Proceedings: 2015 18th International Conference on Network-Based Information Systems

Start Page

646

End Page

651

Start Date

02/09/2015

Finish Date

04/09/2015

ISBN-13

9781479999422

Location

Taipai, Taiwan

Publisher

IEEE

Place of Publication

Piscataway, NJ

Peer Reviewed

Yes

Open Access

No

External Author Affiliations

Japan Advanced Institute of Science and Technology; Japan Science and Technology Agency

Era Eligible

Yes

Name of Conference

2015 18th International Conference on Network-Based Information Systems: NBiS 2015

Exports