{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:41:47Z","timestamp":1758271307117,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,16]],"date-time":"2015-10-16T00:00:00Z","timestamp":1444953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,10,16]]},"DOI":"10.1145\/2808425.2808429","type":"proceedings-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T14:29:08Z","timestamp":1444141748000},"page":"65-76","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["ORAM Based Forward Privacy Preserving Dynamic Searchable Symmetric Encryption Schemes"],"prefix":"10.1145","author":[{"given":"Panagiotis","family":"Rizomiliotis","sequence":"first","affiliation":[{"name":"University of the Aegean, Karlovasi, Samos, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefanos","family":"Gritzalis","sequence":"additional","affiliation":[{"name":"University of the Aegean, Karlovasi,Samos, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,10,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"353","volume":"8042","author":"Cash D.","year":"2013","unstructured":"D. Cash , S. Jarecki , C. Jutla , H. Krawczyk , M.-C. Rosu , and M. Steiner . Highly scalable searchable symmetric encryption with support for Boolean queries. In CRYPTO, LNCS , vol. 8042 , Springer, pages 353 -- 373 , 2013 . D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner. Highly scalable searchable symmetric encryption with support for Boolean queries. In CRYPTO, LNCS, vol. 8042, Springer, pages 353--373, 2013.","journal-title":"In CRYPTO, LNCS"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_1_6_1","first-page":"216","volume":"2003","author":"Goh E. J.","year":"2013","unstructured":"E. J. Goh . Secure indexes. IACR Cryptology e Print Archive , 2003 : 216 , 2013 . E. J. Goh. Secure indexes. IACR Cryptology ePrint Archive, 2003:216, 2013.","journal-title":"Print Archive"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095130"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660297"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095129"},{"key":"e_1_3_2_1_14_1","first-page":"502","volume":"6223","author":"Pinkas B.","year":"2010","unstructured":"B. Pinkas , and T. Reinman . Oblivious RAM Revisited. In CRYPTO, LNCS, Springer , vol. 6223 , pages 502 -- 519 , 2010 . B. Pinkas, and T. Reinman. Oblivious RAM Revisited. In CRYPTO, LNCS, Springer, vol. 6223, pages 502--519, 2010.","journal-title":"Oblivious RAM Revisited. In CRYPTO, LNCS, Springer"},{"key":"e_1_3_2_1_15_1","first-page":"205","volume":"2014","author":"Ren L.","year":"2014","unstructured":"L. Ren , C. Fletcher , A. Kwon , M. van Dijk , and S. Devadas . Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness. IACR Cryptology ePrint Archive , 2014 : 205 , 2014 . L. Ren, C. Fletcher, A. Kwon, M. van Dijk, and S. Devadas. Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness. IACR Cryptology ePrint Archive, 2014:205, 2014.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the Network and Distributed System Security Symposium, NDSS","author":"Sion R.","year":"2007","unstructured":"R. Sion and B. Carbunar . On the practicality of private information retrieval . In Proceedings of the Network and Distributed System Security Symposium, NDSS , 2007 . R. Sion and B. Carbunar. On the practicality of private information retrieval. In Proceedings of the Network and Distributed System Security Symposium, NDSS, 2007."},{"key":"e_1_3_2_1_17_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Song D. X.","year":"2000","unstructured":"D. X. Song , D. Wagner , and A. Perrig . Practical techniques for searches on encrypted data . In IEEE Symposium on Security and Privacy , Washington, DC, USA , 2000 . D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy, Washington, DC, USA, 2000."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_19_1","volume-title":"Practical Dynamic Searchable Encryption with Small Leakage. In the Annual Network and Distributed System Security Symposium, NDSS 2014","author":"Stefanov E.","year":"2014","unstructured":"E. Stefanov , C. Papamanthou , and E. Shi . Practical Dynamic Searchable Encryption with Small Leakage. In the Annual Network and Distributed System Security Symposium, NDSS 2014 , California, USA , 2014 . E. Stefanov, C. Papamanthou, and E. Shi. Practical Dynamic Searchable Encryption with Small Leakage. In the Annual Network and Distributed System Security Symposium, NDSS 2014, California, USA, 2014."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15546-8_7"},{"key":"e_1_3_2_1_21_1","volume-title":"Usable PIR. In NDSS 2008","author":"Williams P.","year":"2008","unstructured":"P. Williams , and R. Sion . Usable PIR. In NDSS 2008 , San Diego, California, USA , 2008 . P. Williams, and R. Sion. Usable PIR. In NDSS 2008, San Diego, California, USA, 2008."},{"key":"e_1_3_2_1_22_1","first-page":"234","volume":"2014","author":"Yu X.","year":"2014","unstructured":"X. Yu , L. Ren , C. Fletcher , A. Kwon , M. van Dijk , and S. Devadas . Enhancing Oblivious RAM Performance Using Dynamic Prefetching. IACR Cryptology ePrint Archive , 2014 : 234 , 2014 . X. Yu, L. Ren, C. Fletcher, A. Kwon, M. van Dijk, and S. Devadas. Enhancing Oblivious RAM Performance Using Dynamic Prefetching. IACR Cryptology ePrint Archive, 2014:234, 2014.","journal-title":"Enhancing Oblivious RAM Performance Using Dynamic Prefetching. IACR Cryptology ePrint Archive"}],"event":{"name":"CCS'15: The 22nd ACM Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Denver Colorado USA","acronym":"CCS'15"},"container-title":["Proceedings of the 2015 ACM Workshop on Cloud Computing Security Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808425.2808429","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2808425.2808429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:41Z","timestamp":1750227161000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808425.2808429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,16]]},"references-count":21,"alternative-id":["10.1145\/2808425.2808429","10.1145\/2808425"],"URL":"https:\/\/doi.org\/10.1145\/2808425.2808429","relation":{},"subject":[],"published":{"date-parts":[[2015,10,16]]},"assertion":[{"value":"2015-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}