{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:10:59Z","timestamp":1763968259119,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1652389"],"award-info":[{"award-number":["CNS-1652389"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134090","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"491-505","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["S\n            <sup>3<\/sup>\n            ORAM"],"prefix":"10.1145","author":[{"given":"Thang","family":"Hoang","sequence":"first","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}]},{"given":"Ceyhun D.","family":"Ozkaptan","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}]},{"given":"Attila A.","family":"Yavuz","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}]},{"given":"Jorge","family":"Guajardo","sequence":"additional","affiliation":[{"name":"Robert Bosch RTC, Pittsburgh, PA, USA"}]},{"given":"Tam","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Asymptotically Tight Bounds for Composing ORAM with PIR IACR International Workshop on Public Key Cryptography. Springer, 91--120","author":"Abraham Ittai","year":"2017","unstructured":"Ittai Abraham, Christopher W Fletcher, Kartik Nayak, Benny Pinkas, and Ling Ren. 2017. Asymptotically Tight Bounds for Composing ORAM with PIR IACR International Workshop on Public Key Cryptography. Springer, 91--120."},{"key":"e_1_3_2_2_2_1","unstructured":"Anastasov Anton. 2016. Implementing Onion ORAM: A Constant Bandwidth ORAM using AHE. https:\/\/github.com\/aanastasov\/onion-oram\/blob\/master\/doc\/report.pdf. (2016)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_8"},{"volume-title":"Robust information-theoretic private information retrieval International Conference on Security in Communication Networks","author":"Beimel Amos","key":"e_1_3_2_2_4_1","unstructured":"Amos Beimel and Yoav Stahl 2002. Robust information-theoretic private information retrieval International Conference on Security in Communication Networks. Springer, 326--341."},{"volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Janos Simon (Ed.). ACM, 1--10","author":"Ben-Or M.","key":"e_1_3_2_2_5_1","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Janos Simon (Ed.). ACM, 1--10."},{"volume-title":"Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM, 837--849","author":"Bindschaedler Vincent","key":"e_1_3_2_2_6_1","unstructured":"Vincent Bindschaedler, Muhammad Naveed, Xiaorui Pan, XiaoFeng Wang, and Yan Huang. 2015. Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM, 837--849."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840761"},{"volume-title":"Oblivious parallel ram: Improved efficiency and generic constructions Theory of Cryptography Conference","author":"Chen Binyi","key":"e_1_3_2_2_8_1","unstructured":"Binyi Chen, Huijia Lin, and Stefano Tessaro 2016. Oblivious parallel ram: Improved efficiency and generic constructions Theory of Cryptography Conference. Springer, 205--234."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9"},{"volume-title":"Combining ORAM with PIR to minimize bandwidth costs Proceedings of the 5th ACM Conference on Data and Application Security and Privacy. ACM, 289--296","author":"Dautrich Jonathan","key":"e_1_3_2_2_11_1","unstructured":"Jonathan Dautrich and Chinya Ravishankar 2015. Combining ORAM with PIR to minimize bandwidth costs Proceedings of the 5th ACM Conference on Data and Application Security and Privacy. ACM, 289--296."},{"volume-title":"Onion oram: A constant bandwidth blowup oblivious ram Theory of Cryptography Conference","author":"Devadas Srinivas","key":"e_1_3_2_2_12_1","unstructured":"Srinivas Devadas, Marten van Dijk, Christopher W Fletcher, Ling Ren, Elaine Shi, and Daniel Wichs. 2016. Onion oram: A constant bandwidth blowup oblivious ram Theory of Cryptography Conference. Springer, 145--174."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_16"},{"key":"e_1_3_2_2_14_1","first-page":"1065","article-title":"Bucket ORAM: single online roundtrip, constant bandwidth oblivious RAM. bibinfotypeTechnical Report. bibinfoinstitutionIACR Cryptology ePrint Archive","volume":"2015","author":"Fletcher Christopher","year":"2015","unstructured":"Christopher Fletcher, Muhammad Naveed, Ling Ren, Elaine Shi, and Emil Stefanov. 2015. Bucket ORAM: single online roundtrip, constant bandwidth oblivious RAM. bibinfotypeTechnical Report. bibinfoinstitutionIACR Cryptology ePrint Archive, Report 2015, 1065.","journal-title":"Report"},{"key":"e_1_3_2_2_15_1","volume-title":"echnical Report. bibinfoinstitutionIACR Cryptology ePrint Archive","author":"Garg Sanjam","year":"2015","unstructured":"Sanjam Garg, Payman Mohassel, and Charalampos Papamanthou. 2015. TWORAM: round-optimal oblivious RAM with applications to searchable encryption. bibinfotypeTechnical Report. bibinfoinstitutionIACR Cryptology ePrint Archive, 2015: 1010."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Yuval Ishai Eyal Kushilevitz and Tal Rabin 2001. The round complexity of verifiable secret sharing and secure multicast Proceedings of the thirty-third annual ACM symposium on Theory of computing. ACM 580--589.","DOI":"10.1145\/380752.380853"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"volume-title":"Optimizing ORAM and using it efficiently for secure computation International Symposium on Privacy Enhancing Technologies Symposium","author":"Gentry Craig","key":"e_1_3_2_2_18_1","unstructured":"Craig Gentry, Kenny A Goldman, Shai Halevi, Charanjit Julta, Mariana Raykova, and Daniel Wichs. 2013. Optimizing ORAM and using it efficiently for secure computation International Symposium on Privacy Enhancing Technologies Symposium. Springer, 1--18."},{"volume-title":"Improving the robustness of private information retrieval 2007 IEEE Symposium on Security and Privacy (SP'07)","author":"Goldberg Ian","key":"e_1_3_2_2_19_1","unstructured":"Ian Goldberg. 2007. Improving the robustness of private information retrieval 2007 IEEE Symposium on Security and Privacy (SP'07). IEEE, 131--148."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs Proceedings of the nineteenth annual ACM symposium on Theory of computing. ACM 182--194.","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2991079.2991088"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879143"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_22"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Travis Mayberry Erik-Oliver Blass and Agnes Hui Chan. 2014. Efficient Private File Retrieval by Combining ORAM and PIR. NDSS. Citeseer.","DOI":"10.14722\/ndss.2014.23033"},{"key":"e_1_3_2_2_27_1","unstructured":"Tarik Moataz Erik-Oliver Blass and Travis Mayberry [n. d.]. CHf-ORAM: A Constant Communication ORAM without Homomorphic Encryption. ( [n. d.])."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813701"},{"key":"e_1_3_2_2_30_1","first-page":"668","article-title":"The Fallacy of Composition of Oblivious RAM and Searchable Encryption","volume":"2015","author":"Naveed Muhammad","year":"2015","unstructured":"Muhammad Naveed. 2015. The Fallacy of Composition of Oblivious RAM and Searchable Encryption. IACR Cryptology ePrint Archive Vol. 2015 (2015), 668.","journal-title":"IACR Cryptology ePrint Archive"},{"volume-title":"Public-key cryptosystems based on composite degree residuosity classes International Conference on the Theory and Applications of Cryptographic Techniques","author":"Paillier Pascal","key":"e_1_3_2_2_31_1","unstructured":"Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 223--238."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_27"},{"key":"e_1_3_2_2_33_1","first-page":"997","article-title":". Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM","volume":"2014","author":"Ren Ling","year":"2014","unstructured":"Ling Ren, Christopher W Fletcher, Albert Kwon, Emil Stefanov, Elaine Shi, Marten van Dijk, and Srinivas Devadas 2014. Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM. IACR Cryptology ePrint Archive Vol. 2014 (2014), 997.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_35_1","volume-title":"Emil Stefanov, and Mingfei Li.","author":"Shi Elaine","year":"2011","unstructured":"Elaine Shi, T-H Hubert Chan, Emil Stefanov, and Mingfei Li. 2011. Oblivious RAM with O ((logN) 3) worst-case cost. Advances in Cryptology-ASIACRYPT 2011. Springer, 197--214."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23298"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516673"},{"key":"e_1_3_2_2_38_1","volume-title":"2013 IEEE Symposium on. IEEE, 253--267","author":"Stefanov Emil","year":"2013","unstructured":"Emil Stefanov and Elaine Shi 2013. Oblivistore: High performance oblivious cloud storage Security and Privacy (SP), 2013 IEEE Symposium on. IEEE, 253--267."},{"key":"e_1_3_2_2_39_1","volume-title":"Towards practical oblivious RAM. arXiv preprint arXiv:1106.3652","author":"Stefanov Emil","year":"2011","unstructured":"Emil Stefanov, Elaine Shi, and Dawn Song 2011. Towards practical oblivious RAM. arXiv preprint arXiv:1106.3652 (2011)."},{"key":"e_1_3_2_2_40_1","volume-title":"Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas","author":"Stefanov Emil","year":"2013","unstructured":"Emil Stefanov, Marten Van Dijk, Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas 2013. Path ORAM: an extremely simple oblivious RAM protocol Proceedings of the 2013 ACM SIGSAC conference on Computer and Communications security. ACM, 299--310."},{"volume-title":"Efficient computationally private information retrieval from anonymity or trapdoor groups International Conference on Information Security","author":"Trostle Jonathan","key":"e_1_3_2_2_41_1","unstructured":"Jonathan Trostle and Andy Parrish 2010. Efficient computationally private information retrieval from anonymity or trapdoor groups International Conference on Information Security. Springer, 114--128."},{"volume-title":"Circuit oram: On tightness of the goldreich-ostrovsky lower bound Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM, 850--861","author":"Wang Xiao","key":"e_1_3_2_2_42_1","unstructured":"Xiao Wang, Hubert Chan, and Elaine Shi 2015. Circuit oram: On tightness of the goldreich-ostrovsky lower bound Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM, 850--861."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660365"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660314"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134090","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134090","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134090"}},"subtitle":["A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":44,"alternative-id":["10.1145\/3133956.3134090","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134090","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}