|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/13711
|
| Title: | A Matrix based ORAM: Design, Implementation and Experimental Analysis |
| Authors: | GORDON, Steven MIYAJI, Atsuko SU, Chunhua SUMONGKAYOTHIN, Karin |
| Keywords: | ORAM secure communication secure access pattern secure protocol |
| Issue Date: | 2016-08-01 |
| Publisher: | The Institute of Electronics, Information and Communication Engineers (IEICE) |
| Magazine name: | IEICE TRANSACTIONS on Information and Systems |
| Volume: | E99-D |
| Number: | 8 |
| Start page: | 2044 |
| End page: | 2055 |
| DOI: | 10.1587/transinf.2015INP0012 |
| Abstract: | Oblivious RAM is a technique for hiding the access patterns between a client and an untrusted server. However, current ORAM algorithms incur large communication or storage overhead. We propose a novel ORAM construction using a matrix logical structure for server storage where a client downloads blocks from each row, choosing the column randomly to hide the access pattern. Both a normal construction and recursive construction, where a position map normally stored on the client is also stored on the server, are presented. We show our matrix ORAM achieves constant bandwidth cost for the normal construction, uses similar storage to the existing Path ORAM, and improves open the bandwidth cost compared to Path ORAM under certain conditions in the recursive construction. |
| Rights: | Copyright (C)2016 IEICE. Steven GORDON, Atsuko MIYAJI, Chunhua SU, and Karin SUMONGKAYOTHIN, IEICE TRANSACTIONS on Information and Systems, E99-D(8), 2016, 2044-2055. http://www.ieice.org/jpn/trans_online/ |
| URI: | https://hdl.handle.net/10119/13711 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
| 22519.pdf | | 1613Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|