| Presentation | 2018-03-08 Succinct Oblivious RAM Taku Onodera, Tetsuo Shibuya, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | As online storage services become increasingly common, it is important that users’ private information is protected from database access pattern analyses. Oblivious RAM (ORAM) is a cryptographic primitive that enables users to perform arbitrary database accesses without revealing any information about the access pattern to the server. Previous ORAM studies focused mostly on reducing the access overhead. Consequently, the access overhead of the state-of-the-art ORAM constructions are almost at practical levels in certain application scenarios such as secure processors. However, we assume that the server space usage could become a new important issue in the coming big-data era. To enable large-scale computation in security-aware settings, it is necessary to rethink the ORAM server space cost using big-data standards. In this paper, we introduce “succinctness” as a theoretically tractable and practically relevant criterion of the ORAM server space efficiency in the big-data era. We, then, propose two succinct ORAM constructions that also exhibit state-of-the-art performance in terms of the bandwidth blowup and the user space. We also give non-asymptotic analyses and simulation results which indicate that the proposed ORAM constructions are practically effective. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Oblivious RAM / Succinct data structure / Balls-into-bins |
| Paper # | IT2017-119,ISEC2017-107,WBS2017-100 |
| Date of Issue | 2018-03-01 (IT, ISEC, WBS) |
| Conference Information | |
| Committee | WBS / IT / ISEC |
|---|---|
| Conference Date | 2018/3/8(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Katsusika Campas, Tokyo University of Science |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | joint meeting of IT, ISEC, and WBS |
| Chair | Fumiaki Maehara(Waseda Univ.) / Masayoshi Ohashi(Fukuoka Univ.) / Kazuto Ogawa(NHK) |
| Vice Chair | Masanori Hamamura(Kochi Univ. of Tech.) / Fumie Ono(NICT) / Jun Muramatsu(NTT) / Atsushi Fujioka(Kanagawa Univ.) / Shiho Moriai(NICT) |
| Secretary | Masanori Hamamura(Mitsubishi Electric) / Fumie Ono(Ibaraki Univ.) / Jun Muramatsu(Yokohama College of Commerce) / Atsushi Fujioka(UEC) / Shiho Moriai(Tohoku Univ.) |
| Assistant | Akira Nakamura(Tokyo Univ. of Science) / Ryohei Nakamura(National Defense Academy) / Sigeaki Kuzuoka(wakayama univ.) / Keita Emura(NICT) / Yuichi Komano(TOSHIBA) / Yuuji Suga(IIJ) |
| Paper Information | |
| Registration To | Technical Committee on Wideband System / Technical Committee on Information Theory / Technical Committee on Information Security |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Succinct Oblivious RAM |
| Sub Title (in English) | |
| Keyword(1) | Oblivious RAM |
| Keyword(2) | Succinct data structure |
| Keyword(3) | Balls-into-bins |
| 1st Author's Name | Taku Onodera |
| 1st Author's Affiliation | Institute of Medical Science, The University of Tokyo(IMSUT) |
| 2nd Author's Name | Tetsuo Shibuya |
| 2nd Author's Affiliation | Institute of Medical Science, The University of Tokyo(IMSUT) |
| Date | 2018-03-08 |
| Paper # | IT2017-119,ISEC2017-107,WBS2017-100 |
| Volume (vol) | vol.117 |
| Number (no) | IT-487,ISEC-488,WBS-489 |
| Page | pp.pp.89-96(IT), pp.89-96(ISEC), pp.89-96(WBS), |
| #Pages | 8 |
| Date of Issue | 2018-03-01 (IT, ISEC, WBS) |