{"title":"Evaluation of Memory Access Pattern Protection in a Practical Setting","authors":"Yuto Nakano, S. Kiyomoto, Yutaka Miyake","doi":"10.14257/ASTL.2014.48.01","DOIUrl":null,"url":null,"abstract":"Oblivious RAM schemes were proposed to protect software on un- trusted systems. However their huge overhead encumbers their practical deploy- ment. Recently, we proposed a new protection scheme using history of accesses. However, only the concept of the scheme was presented, and several issues were unclear for its implementation. In this paper, we propose a new instance of the scheme, which can be implemented with only software with less overhead than the previous instance. We also consider three attack scenarios and propose coun- termeasures. We implement the scheme with countermeasure and show that our scheme only requires 0.125(s) to write 1MB data.","PeriodicalId":153703,"journal":{"name":"Advanced Science and Technology Letters","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advanced Science and Technology Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14257/ASTL.2014.48.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Oblivious RAM schemes were proposed to protect software on un- trusted systems. However their huge overhead encumbers their practical deploy- ment. Recently, we proposed a new protection scheme using history of accesses. However, only the concept of the scheme was presented, and several issues were unclear for its implementation. In this paper, we propose a new instance of the scheme, which can be implemented with only software with less overhead than the previous instance. We also consider three attack scenarios and propose coun- termeasures. We implement the scheme with countermeasure and show that our scheme only requires 0.125(s) to write 1MB data.