{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:12:47Z","timestamp":1743102767825,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811003554"},{"type":"electronic","value":"9789811003561"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-981-10-0356-1_62","type":"book-chapter","created":{"date-parts":[[2016,1,18]],"date-time":"2016-01-18T09:24:58Z","timestamp":1453109098000},"page":"596-607","source":"Crossref","is-referenced-by-count":0,"title":["Efficient ORAM Based on Binary Tree without Data Overflow and Evictions"],"prefix":"10.1007","author":[{"given":"Shufeng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochao","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,19]]},"reference":[{"key":"62_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39077-7_1","volume-title":"Privacy Enhancing Technologies","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Goldman, K.A., Halevi, S., Julta, C., Raykova, M., Wichs, D.: Optimizing ORAM and using it efficiently for secure computation. In: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol. 7981, pp. 1\u201318. Springer, Heidelberg (2013)"},{"key":"62_CR2","unstructured":"Gentry, C., Halevi, S., Jutla, C., et al.: Private database access with he-over-oram architecture. Cryptology ePrint Archive, report 2014\/345 (2014). \n                    http:\/\/eprint.iacr.org"},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., et al.: Secure two-party computation in sublinear (amortized) time. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 513\u2013524. ACM (2012)","DOI":"10.1145\/2382196.2382251"},{"key":"62_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/978-3-662-45608-8_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"M Keller","year":"2014","unstructured":"Keller, M., Scholl, P.: Efficient, oblivious data structures for MPC. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 506\u2013525. Springer, Heidelberg (2014)"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Liu, C., Huang, Y., Shi, E., et al.: Automating efficient RAM-model secure computation. In: 2014 IEEE Symposium on Security and Privacy (SP), pp. 623\u2013638. IEEE (2014)","DOI":"10.1109\/SP.2014.46"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Huang, Y., Chan, T.H., et al.: Scoram: oblivious RAM for secure computation. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 191\u2013202. ACM (2014)","DOI":"10.1145\/2660267.2660365"},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Fletcher, C.W., Dijk, M., Devadas, S.: A secure processor architecture for encrypted computation on untrusted programs. In: Proceedings of the Seventh ACM Workshop on Scalable Trusted Computing, pp. 3\u20138. ACM (2012)","DOI":"10.1145\/2382536.2382540"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Fletchery, C.W., Ren, L., Yu, X., et al.: Suppressing the oblivious RAM timing channel while making information leakage and program efficiency trade-offs. In: 2014 IEEE 20th International Symposium on High Performance Computer Architecture (HPCA), pp. 213\u2013224. IEEE (2014)","DOI":"10.1109\/HPCA.2014.6835932"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Maas, M., Love, E., Stefanov, E., et al.: Phantom: practical oblivious computation in a secure processor. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 311\u2013324. ACM (2013)","DOI":"10.1145\/2508859.2516692"},{"issue":"3","key":"62_CR10","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1145\/2508148.2485971","volume":"41","author":"Ling Ren","year":"2013","unstructured":"Ren, L., Yu, X., Fletcher, C.W., et al.: Design space exploration and optimization of path oblivious RAM in secure processors. In: ACM SIGARCH Computer Architecture News, vol. 41(3), pp. 571-582. ACM (2013)","journal-title":"ACM SIGARCH Computer Architecture News"},{"key":"62_CR11","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: Multi-cloud oblivious storage. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 247\u2013258. ACM (2013)","DOI":"10.1145\/2508859.2516673"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: Oblivistore: high performance oblivious cloud storage. In: 2013 IEEE Symposium on Security and Privacy (SP), pp. 253\u2013267. IEEE (2013)","DOI":"10.1109\/SP.2013.25"},{"key":"62_CR13","doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R., Carbunar, B.: Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 139\u2013148. ACM (2008)","DOI":"10.1145\/1455770.1455790"},{"key":"62_CR14","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: Network and Distributed System Security Symposium (NDSS 2014) (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"62_CR15","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., et al.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79\u201388. ACM (2006)","DOI":"10.1145\/1180405.1180417"},{"issue":"5","key":"62_CR16","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J., Kamara, S., et al.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"key":"62_CR17","doi-asserted-by":"crossref","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Poster: inference attacks against searchable encryption protocols. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, pp. 845\u2013448. ACM (2011)","DOI":"10.1145\/2046707.2093508"},{"key":"62_CR18","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2013.11.021","volume":"265","author":"C Liu","year":"2014","unstructured":"Liu, C., Zhu, L., Wang, M., et al.: Search pattern leakage in searchable encryption: attacks and new construction. Inf. Sci. 265, 176\u2013188 (2014)","journal-title":"Inf. Sci."},{"issue":"4","key":"62_CR19","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/s00145-011-9107-0","volume":"25","author":"Y Lindell","year":"2012","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. J. Cryptol. 25(4), 680\u2013722 (2012)","journal-title":"J. Cryptol."},{"key":"62_CR20","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., et al.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium, vol. 201(1) (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"62_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40084-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y Lindell","year":"2013","unstructured":"Lindell, Y.: Fast cut-and-choose based protocols for malicious and covert adversaries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 1\u201317. Springer, Heidelberg (2013)"},{"key":"62_CR22","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., et al.: Secure two-party computation in sublinear (amortized) time. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 513\u2013524. ACM (2012)","DOI":"10.1145\/2382196.2382251"},{"key":"62_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-94-007-1338-3_3","volume-title":"Security Trends for FPGAS","author":"V Lomne","year":"2011","unstructured":"Lomne, V., Dehaboui, A., Maurine, P., et al.: Side channel attacks. In: Badrignans, B., Danger, J.L., Fischer, V., Gogniat, G., Torres, L. (eds.) Security Trends for FPGAS, pp. 47\u201372. Springer, Netherlands (2011)"},{"key":"62_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO 1996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"62_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/10721064_15","volume-title":"Smart Card. Research and Applications","author":"JF Dhem","year":"2000","unstructured":"Dhem, J.F., Koeune, F., Leroux, P.A., Mestr\u00e9, P., Quisquater, J.-J., Willems, J.-L.: A practical implementation of the timing attack. In: Schneier, B., Quisquater, J.-J. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 167\u2013182. Springer, Heidelberg (2000)"},{"issue":"3","key":"62_CR26","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM (JACM) 43(3), 431\u2013473 (1996)","journal-title":"J. ACM (JACM)"},{"key":"62_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E Shi","year":"2011","unstructured":"Shi, E., Chan, T.H.H., Stefanov, E., Li, M.: Oblivious RAM with O(logN)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197\u2013214. Springer, Heidelberg (2011)"},{"key":"62_CR28","unstructured":"Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM (2011). arXiv preprint \n                    arXiv:1106.3652"},{"key":"62_CR29","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Van Dijk, M., Shi, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 299\u2013310. ACM (2013)","DOI":"10.1145\/2508859.2516660"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-0356-1_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:29:06Z","timestamp":1559370546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-0356-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9789811003554","9789811003561"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-0356-1_62","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}