{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:40:08Z","timestamp":1746402008294,"version":"3.40.4"},"reference-count":47,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2014]]},"DOI":"10.1587\/transinf.2013thp0007","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T01:02:15Z","timestamp":1412125335000},"page":"2576-2585","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation"],"prefix":"10.1587","volume":"E97.D","author":[{"given":"Yuto","family":"NAKANO","sequence":"first","affiliation":[{"name":"KDDI R&D Laboratories Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"KIYOMOTO","sequence":"additional","affiliation":[{"name":"KDDI R&D Laboratories Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutaka","family":"MIYAKE","sequence":"additional","affiliation":[{"name":"KDDI R&D Laboratories Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"SAKURAI","sequence":"additional","affiliation":[{"name":"Kyushu University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Y. Nakano, C. Cid, S. Kiyomoto, and Y. Miyake, \u201cMemory access pattern protection for resource-constrained devices,\u201d CARDIS, LNCS, vol.7771, pp.188-202, 2012."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Y. Nakano, S. Kiyomoto, and Y. Miyake, \u201cEvaluation of memory access pattern protection in a practical setting,\u201d ISA, ASTL, vol.48, pp.1-6, 2014.","DOI":"10.14257\/astl.2014.48.01"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] O. Goldreich, \u201cTowards a theory of software protection and simulation by oblivious RAMs,\u201d STOC, pp.182-194, 1987.","DOI":"10.1145\/28395.28416"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] O. Goldreich and R. Ostrovsky, \u201cSoftware protection and simulation on oblivious RAMs,\u201d J. ACM, vol.43, no.3, pp.431-473, 1996.","DOI":"10.1145\/233551.233553"},{"key":"5","unstructured":"[5] B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, \u201cPrivate information retrieval,\u201d FOCS, pp.41-50, 1995."},{"key":"6","unstructured":"[6] J.R. Lorch, J.W. Mickens, B. Parno, M. Raykova, and J. Schiffman, \u201cToward practical private access to data centers via parallel ORAM,\u201d IACR ePrint, vol.2012, p.133, 2012."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di, \u201cAn <i>O<\/i>(<i>n<\/i>log <i>n<\/i>) sorting network,\u201d STOC, pp.1-9, 1983.","DOI":"10.1145\/800061.808726"},{"key":"8","unstructured":"[8] K.E. Batcher, \u201cSorting networks and their applications,\u201d AFIPS Spring Joint Computing Conference, AFIPS Conference Proceedings, vol.32, pp.307-314, 1968."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] M. Ajtai, \u201cOblivious RAMs without cryptographic assumptions,\u201d STOC, pp.181-190, 2010.","DOI":"10.1145\/1806689.1806716"},{"key":"10","unstructured":"[10] P. Williams and R. Sion, \u201cUsable PIR,\u201d NDSS, 2008."},{"key":"11","unstructured":"[11] B. Pinkas and T. Reinman, \u201cOblivious RAM revisited,\u201d CRYPTO, LNCS, vol.6223, pp.502-519, 2010."},{"key":"12","unstructured":"[12] D. Boneh, D. Mazieres, and R.A. Popa, \u201cRemote oblivious storage: Making oblivious RAM practical,\u201d Tech. Rep. MIT-CSAIL-TR-2011-018, Massachusetts Institute of Technology, 2011."},{"key":"13","unstructured":"[13] I. Damg\u00e5rd, S. Meldgaard, and J.B. Nielsen, \u201cPerfectly secure oblivious RAM without random oracles,\u201d TCC, LNCS, vol.6597, pp.144-163, 2011."},{"key":"14","unstructured":"[14] E. Shi, T.H.H. Chan, E. Stefanov, and M. Li, \u201cOblivious RAM with <i>O<\/i>((log <i>N<\/i>)<sup>3<\/sup>) worst-case cost,\u201d ASIACRYPT, LNCS, vol.7073, pp.197-214, 2011."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M.T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia, \u201cPrivacy-preserving group data access via stateless oblivious RAM simulation,\u201d SODA, pp.157-167, 2012.","DOI":"10.1137\/1.9781611973099.14"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] E. Kushilevitz, S. Lu, and R. Ostrovsky, \u201cOn the (in)security of hash-based oblivious RAM and a new balancing scheme,\u201d SODA, pp.143-156, 2012.","DOI":"10.1137\/1.9781611973099.13"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] E. Stefanov and E. Shi, \u201cObliviStore: High performance oblivious cloud storage,\u201d IEEE Symposium on Security and Privacy, pp.253-267, 2013.","DOI":"10.1109\/SP.2013.25"},{"key":"18","unstructured":"[18] E. Stefanov, E. Shi, and D.X. Song, \u201cTowards practical oblivious RAM,\u201d NDSS, 2012."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] P. Williams and R. Sion, \u201cSingle round access privacy on outsourced storage,\u201d ACM Conference on Computer and Communications Security, pp.293-304, 2012.","DOI":"10.1145\/2382196.2382229"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] E. Stefanov, M. van Dijk, E. Shi, C.W. Fletcher, L. Ren, X. Yu, and S. Devadas, \u201cPath ORAM: An extremely simple oblivious RAM protocol,\u201d ACM Conference on Computer and Communications Security, pp.299-310, 2013.","DOI":"10.1145\/2508859.2516660"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] P. Williams, R. Sion, and A. Tomescu, \u201cPrivateFS: A parallel oblivious file system,\u201d ACM CCS, pp.977-988, 2012.","DOI":"10.1145\/2382196.2382299"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] P. Williams, R. Sion, and B. Carbunar, \u201cBuilding castles out of mud: Practical access pattern privacy and correctness on untrusted storage,\u201d ACM Conference on Computer and Communications Security, pp.139-148, 2008.","DOI":"10.1145\/1455770.1455790"},{"key":"23","unstructured":"[23] C. Gentry, K.A. Goldman, S. Halevi, C.S. Jutla, M. Raykova, and D. Wichs, \u201cOptimizing ORAM and using it efficiently for secure computation,\u201d Privacy Enhancing Technologies, LNCS, vol.7981, pp.1-18, 2013."},{"key":"24","unstructured":"[24] M.T. Goodrich and M. Mitzenmacher, \u201cPrivacy-preserving access of outsourced data via oblivious RAM simulation,\u201d ICALP (2), LNCS, vol.6756, pp.576-587, 2011."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] M.T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia, \u201cOblivious RAM simulation with efficient worst-case access overhead,\u201d CCSW, pp.95-100, 2011.","DOI":"10.1145\/2046660.2046680"},{"key":"26","unstructured":"[26] S. Lu and R. Ostrovsky, \u201cDistributed oblivious RAM for secure two-party computation,\u201d IACR ePrint, vol.2011, p.384, 2011."},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] X. Zhuang, T. Zhang, H.H.S. Lee, and S. Pande, \u201cHardware assisted control flow obfuscation for embedded processors,\u201d CASES, pp.292-302, 2004.","DOI":"10.1145\/1023833.1023873"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] B. Chor and N. Gilboa, \u201cComputationally private information retrieval (Extended abstract),\u201d STOC, pp.304-313, 1997.","DOI":"10.1145\/258533.258609"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] E. Kushilevitz and R. Ostrovsky, \u201cReplication is NOT needed: SINGLE database, computationally-private information retrieval,\u201d FOCS, pp.364-373, 1997.","DOI":"10.1109\/SFCS.1997.646125"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, \u201cPrivate information retrieval,\u201d J. ACM, vol.45, no.6, pp.965-981, 1998.","DOI":"10.1145\/293347.293350"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] A. Beimel and Y. Stahl, \u201cRobust information-theoretic private information retrieval,\u201d J. Cryptology, vol.20, no.3, pp.295-321, 2007.","DOI":"10.1007\/s00145-007-0424-2"},{"key":"32","unstructured":"[32] S.W. Smith and D. Safford, \u201cPractical private information retrieval with secure coprocessors.\u201d Technical Report, IBM Research Division, 2000."},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] S.W. Smith and D. Safford, \u201cPractical server privacy with secure coprocessors,\u201d IBM Systems Journal, vol.40, no.3, pp.683-695, 2001.","DOI":"10.1147\/sj.403.0683"},{"key":"34","unstructured":"[34] D. Asonov and J.C. Freytag, \u201cAlmost optimal private information retrieval,\u201d Privacy Enhancing Technologies, LNCS, vol.2482, pp.209-223, 2002."},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] I. Goldberg, \u201cImproving the robustness of private information retrieval,\u201d IEEE Symposium on Security and Privacy, pp.131-148, 2007.","DOI":"10.1109\/SP.2007.23"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] M.T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia, \u201cPractical oblivious storage,\u201d CODASPY, pp.13-24, 2012.","DOI":"10.1145\/2133601.2133604"},{"key":"37","unstructured":"[37] C. Devet, I. Goldberg, and N. Heninger, \u201cOptimally robust private information retrieval,\u201d Proc. 21st USENIX Conference on Security Symposium, Security&apos;12, Berkeley, CA, USA, 2012."},{"key":"38","unstructured":"[38] I. Goldberg, \u201cPercy++ project,\u201d SourceForge, http:\/\/percy.sourceforge.net\/"},{"key":"39","unstructured":"[39] F. Bao, R.H. Deng, and P. Feng, \u201cAn efficient and practical scheme for privacy protection in the E-commerce of digital goods,\u201d ICISC, LNCS, vol.2015, pp.162-170, 2000."},{"key":"40","unstructured":"[40] C.P. Schnorr and M. Jakobsson, \u201cSecurity of signed ElGamal encryption,\u201d ASIACRYPT, LNCS, vol.1976, pp.73-89, 2000."},{"key":"41","doi-asserted-by":"crossref","unstructured":"[41] Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, \u201cProtecting data privacy in private information retrieval schemes,\u201d STOC, pp.151-160, 1998.","DOI":"10.1145\/276698.276723"},{"key":"42","doi-asserted-by":"crossref","unstructured":"[42] R. Henry, F.G. Olumofin, and I. Goldberg, \u201cPractical PIR for electronic commerce,\u201d ACM Conference on Computer and Communications Security, pp.677-690, 2011.","DOI":"10.1145\/2046707.2046784"},{"key":"43","unstructured":"[43] C.A. Melchor and P. Gaborit, \u201cA fast private information retrieval protocol,\u201d ISIT, pp.1848-1852, 2008."},{"key":"44","unstructured":"[44] C.A. Melchor, G. Castagnos, and P. Gaborit, \u201cLattice-based homomorphic encryption of vector spaces,\u201d ISIT, pp.1858-1862, 2008."},{"key":"45","unstructured":"[45] F.G. Olumofin and I. Goldberg, \u201cRevisiting the computational practicality of private information retrieval,\u201d Financial Cryptography, LNCS, vol.7035, pp.158-172, 2012."},{"key":"46","doi-asserted-by":"crossref","unstructured":"[46] Y. Huang and I. Goldberg, \u201cOutsourced private information retrieval,\u201d WPES, pp.119-130, 2013.","DOI":"10.1145\/2517840.2517854"},{"key":"47","doi-asserted-by":"crossref","unstructured":"[47] K. Fukushima, S. Kiyomoto, T. Tanaka, and K. Sakurai, \u201cAnalysis of program obfuscation schemes with variable encoding technique,\u201d IEICE Trans. Fundamentals, vol.E91-A, no.1, pp.316-329, Jan. 2008.","DOI":"10.1093\/ietfec\/e91-a.1.316"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E97.D\/10\/E97.D_2013THP0007\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:07:04Z","timestamp":1746400024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E97.D\/10\/E97.D_2013THP0007\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":47,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2014]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2013thp0007","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2014]]}}}