{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T19:08:04Z","timestamp":1784833684278,"version":"3.55.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325747","type":"print"},{"value":"9783032325754","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T00:00:00Z","timestamp":1784851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T00:00:00Z","timestamp":1784851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-32575-4_2","type":"book-chapter","created":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:44:36Z","timestamp":1784832276000},"page":"33-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BI-ORAM: An\u00a0Oblivious Bulk-Insertion Log Table"],"prefix":"10.1007","author":[{"given":"Zhiqiang","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Appan, A., Heath, D., Ren, L.: Oblivious single access machines-a new model for oblivious computation. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 3080\u20133094 (2024)","DOI":"10.1145\/3658644.3690352"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Asharov, G., Eiluz, E., Komargodski, I., Lin, W.K.: Megablocks: breaking the logarithmic I\/O-overhead barrier for oblivious RAM. In: Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, pp. 4692\u20134706 (2025)","DOI":"10.1145\/3719027.3765159"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Asharov, G., Komargodski, I., Lin, W.K., Nayak, K., Peserico, E., Shi, E.: Optorama: optimal oblivious ram. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 403\u2013432. Springer (2020)","DOI":"10.1007\/978-3-030-45724-2_14"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Asharov, G., Komargodski, I., Michelson, Y.: Futorama: a concretely efficient hierarchical oblivious ram. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 3313\u20133327 (2023)","DOI":"10.1145\/3576915.3623125"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Blackstone, L., Kamara, S., Moataz, T.: Revisiting leakage abuse attacks. Cryptology ePrint Archive (2019)","DOI":"10.14722\/ndss.2020.23103"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 668\u2013679 (2015)","DOI":"10.1145\/2810103.2813700"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborti, A., Aviv, A.J., Choi, S.G., Mayberry, T., Roche, D.S., Sion, R.: rORAM: efficient range ORAM with O(log2 N) locality. In: NDSS (2019)","DOI":"10.14722\/ndss.2019.23320"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chakraborti, A., Sion, R.: Concuroram: high-throughput stateless parallel multi-client ORAM. arXiv preprint arXiv:1811.04366 (2018)","DOI":"10.14722\/ndss.2019.23411"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Che, Y., Wang, R.: Multi-range supported oblivious ram for efficient block data retrieval. In: 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 369\u2013382. IEEE (2020)","DOI":"10.1109\/HPCA47549.2020.00038"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Chen, H., Chillotti, I., Ren, L.: Onion ring ORAM: efficient constant bandwidth oblivious ram from (leveled) TFHE. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 345\u2013360 (2019)","DOI":"10.1145\/3319535.3354226"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Chen, W., Popa, R.A.: Metal: a metadata-hiding file-sharing system. In: NDSS Symposium, p. 2020 (2020)","DOI":"10.14722\/ndss.2020.24095"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"5143","DOI":"10.1109\/TDSC.2023.3241184","volume":"20","author":"W Cheng","year":"2023","unstructured":"Cheng, W., Sang, D., Zeng, L., Wang, Y., Brinkmann, A.: Tianji: securing a practical asynchronous multi-user ORAM. IEEE Trans. Dependable Secure Comput. 20(6), 5143\u20135155 (2023)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"2_CR13","unstructured":"Damie, M., Hahn, F., Peter, A.: A highly accurate $${Query-Recovery}$$ attack against searchable encryption using $${Non-Indexed}$$ documents. In: 30th USENIX Security Symposium (USENIX Security 2021), pp. 143\u2013160 (2021)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Deli, M.S.M., Ismail, S.A., Kama, N., Yusop, O.M., Azmi, A., Yahya, Y.: Malware log files for internet investigation using hadoop: a review. In: 2017 IEEE Conference on Big Data and Analytics (ICBDA), pp. 87\u201392. IEEE (2017)","DOI":"10.1109\/ICBDAA.2017.8284112"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 182\u2013194 (1987)","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"2_CR16","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":"2_CR17","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: NDSS, vol.\u00a020, p.\u00a012 (2012)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Lambregts, S., Chen, H., Ning, J., Liang, K.: Val: volume and access pattern leakage-abuse attack with leaked documents. In: European Symposium on Research in Computer Security, pp. 653\u2013676. Springer (2022)","DOI":"10.1007\/978-3-031-17140-6_32"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Li, X., Luo, Y., Gao, M.: Bulkor: enabling bulk loading for path ORAM. In: 2024 IEEE Symposium on Security and Privacy (S&P), pp. 4258\u20134276 (2024)","DOI":"10.1109\/SP54263.2024.00103"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Liu, C., Zhu, L., Wang, M., Tan, Y.A.: Search pattern leakage in searchable encryption: attacks and new construction. Inf. Sci. 265, 176\u2013188 (2014)","DOI":"10.1016\/j.ins.2013.11.021"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Mishra, P., Poddar, R., Chen, J., Chiesa, A., Popa, R.A.: Oblix: an efficient oblivious search index. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 279\u2013296. IEEE (2018)","DOI":"10.1109\/SP.2018.00045"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Ning, J., et al.: Leap: leakage-abuse attack on efficiently deployable, efficiently searchable encryption with partially known dataset. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2307\u20132320 (2021)","DOI":"10.1145\/3460120.3484540"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Oliner, A., Stearley, J.: What supercomputers say: a study of five system logs. In: 37th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN 2007), pp. 575\u2013584. IEEE (2007)","DOI":"10.1109\/DSN.2007.103"},{"key":"2_CR24","unstructured":"Oya, S., Kerschbaum, F.: Hiding the access pattern is not enough: exploiting search pattern leakage in searchable encryption. In: 30th USENIX Security Symposium (USENIX Security 2021), pp. 127\u2013142 (2021)"},{"key":"2_CR25","unstructured":"Oya, S., Kerschbaum, F.: $${IHOP}$$: improved statistical query recovery against searchable symmetric encryption through quadratic optimization. In: 31st USENIX Security Symposium (USENIX Security 2022), pp. 2407\u20132424 (2022)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Raykova, M., Yeo, K.: Panorama: oblivious ram with logarithmic overhead. In: IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 871\u2013882. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00087"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Pouliot, D., Wright, C.V.: The shadow nemesis: inference attacks on efficiently deployable, efficiently searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1341\u20131352 (2016)","DOI":"10.1145\/2976749.2978401"},{"key":"2_CR28","unstructured":"Ren, L., et al.: Constants count: practical improvements to oblivious $${RAM}$$. In: 24th USENIX Security Symposium (USENIX Security 2015), pp. 415\u2013430 (2015)"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Sahin, C., Zakhary, V., El Abbadi, A., Lin, H., Tessaro, S.: Taostore: overcoming asynchronicity in oblivious data storage. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 198\u2013217. IEEE (2016)","DOI":"10.1109\/SP.2016.20"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Stearley, J.: Towards informatic analysis of syslogs. In: 2004 IEEE International Conference on Cluster Computing (IEEE Cat. No. 04EX935), pp. 309\u2013318. IEEE (2004)","DOI":"10.1109\/CLUSTR.2004.1392628"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious ram protocol. J. ACM (JACM) 65(4), 1\u201326 (2018)","DOI":"10.1145\/3177872"},{"key":"2_CR32","unstructured":"Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM. arXiv preprint arXiv:1106.3652 (2011)"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: the 2013 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 299\u2013310. ACM (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"2_CR34","unstructured":"Vadapalli, A., Henry, R., Goldberg, I.: Duoram: A $${Bandwidth-Efficient}$$ distributed $${ORAM}$$ for 2-and 3-party computation. In: 32nd USENIX Security Symposium (USENIX Security 2023), pp. 3907\u20133924 (2023)"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Wu, Z., Li, R.: OBI: a multi-path oblivious ram for forward-and-backward-secure searchable encryption. In: NDSS (2023)","DOI":"10.14722\/ndss.2023.24423"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"5310","DOI":"10.1109\/TIFS.2021.3128823","volume":"16","author":"L Xu","year":"2021","unstructured":"Xu, L., Duan, H., Zhou, A., Yuan, X., Wang, C.: Interpreting and mitigating leakage-abuse attacks in searchable symmetric encryption. IEEE Trans. Inf. Forensics Secur. 16, 5310\u20135325 (2021)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Xu, L., Zheng, L., Xu, C., Yuan, X., Wang, C.: Leakage-abuse attacks against forward and backward private searchable symmetric encryption. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 3003\u20133017 (2023)","DOI":"10.1145\/3576915.3623085"},{"issue":"11","key":"2_CR38","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.jpdc.2006.05.007","volume":"66","author":"Z Zeng","year":"2006","unstructured":"Zeng, Z., Veeravalli, B.: Distributed scheduling strategy for divisible loads on arbitrarily configured distributed networks using load balancing via virtual routing. J. Parallel Distrib. Comput. 66(11), 1404\u20131418 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"10","key":"2_CR39","doi-asserted-by":"publisher","first-page":"2934","DOI":"10.1016\/j.jpdc.2014.06.010","volume":"74","author":"Z Zeng","year":"2014","unstructured":"Zeng, Z., Veeravalli, B.: Optimal metadata replications and request balancing strategy on cloud data centers. J. Parallel Distrib. Comput. 74(10), 2934\u20132940 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"2_CR40","unstructured":"Zhang, B., Cui, H., Yuan, X., Yu, Z., Guo, B.: $${V-ORAM}$$: a versatile and adaptive $${ORAM}$$ framework with service transformation for dynamic workloads. In: 34th USENIX Security Symposium (USENIX Security 2025), pp. 7917\u20137936 (2025)"},{"key":"2_CR41","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of $${File-Injection}$$ attacks on searchable encryption. In: 25th USENIX Security Symposium (USENIX Security 2016), pp. 707\u2013720 (2016)"},{"key":"2_CR42","unstructured":"Zheng, L., Zhang, Z., Dong, W., Zhang, Y., Wu, Y., Wang, C.: $${H2O2RAM}$$: a $${high-performance}$$ hierarchical doubly oblivious $${RAM}$$. In: 34th USENIX Security Symposium (USENIX Security 2025), pp. 8501\u20138520 (2025)"},{"issue":"10","key":"2_CR43","doi-asserted-by":"publisher","first-page":"2279","DOI":"10.1109\/TCAD.2019.2948914","volume":"39","author":"J Zhu","year":"2019","unstructured":"Zhu, J., et al.: Fork path: batching ORAM requests to remove redundant memory accesses. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(10), 2279\u20132292 (2019)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"8","key":"2_CR44","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1109\/TC.2023.3248272","volume":"72","author":"J Zhu","year":"2023","unstructured":"Zhu, J., Li, M., Zhang, X., Bu, K., Zhang, M., Song, T.: Hitchhiker: accelerating ORAM with dynamic scheduling. IEEE Trans. Comput. 72(8), 2321\u20132335 (2023)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32575-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:44:42Z","timestamp":1784832282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32575-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,24]]},"ISBN":["9783032325747","9783032325754"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32575-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,24]]},"assertion":[{"value":"24 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}