DivORAM: Towards a practical oblivious RAM with variable block size
- Submitting institution
-
Middlesex University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 347
- Type
- D - Journal article
- DOI
-
10.1016/j.ins.2018.02.071
- Title of journal
- Information Sciences
- Article number
- -
- First page
- 1
- Volume
- 447
- Issue
- -
- ISSN
- 0020-0255
- Open access status
- Not compliant
- Month of publication
- March
- Year of publication
- 2018
- URL
-
http://eprints.mdx.ac.uk/24575/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 47
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- In cloud based storage systems, data access patterns may be exploited to, for example, intrude on someone’s privacy. An existing algorithm, Oblivious RAM (ORAM), hides access patterns by re-encrypting each data block and changing the storage location of data in every access. This paper develops the first practical ORAM with variable block size, DivORAM. It remodels ORAM’s tree-based structure by employing an additively homomorphic encryption scheme on the server side to save client computing overhead and communication bandwidth. This supports mobile IoT clients. The paper is significant because it increases cloud based file system security.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -