{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T03:10:07Z","timestamp":1748747407169,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319291710"},{"type":"electronic","value":"9783319291727"}],"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-3-319-29172-7_9","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T11:38:22Z","timestamp":1452253102000},"page":"134-151","source":"Crossref","is-referenced-by-count":3,"title":["Closing the Gap: A Universal Privacy Framework for Outsourced Data"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Achenbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"Rill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"9_CR1","unstructured":"B\u00f6hl, F., Hofheinz, D., Kraschewski, D.: On definitions of selective opening security. Cryptology ePrint Archive, Report 2011\/678 (2011). http:\/\/eprint.iacr.org\/2011\/678"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.A.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). http:\/\/dx.doi.org\/10.1007\/3-540-48910-X_28"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M., Steiner, M.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: Network and Distributed System Security Symposium, NDSS, vol. 14 (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"H Krawczyk","year":"2013","unstructured":"Krawczyk, H., Jarecki, S., Steiner, M., Jutla, C., Cash, D., Ro\u015fu, M.-C.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013)"},{"key":"9_CR6","unstructured":"Chase, M., Shen, E.: Pattern matching encryption. Cryptology ePrint Archive, Report 2014\/638 (2014). http:\/\/eprint.iacr.org\/2014\/638"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998). http:\/\/doi.acm.org\/10.1145\/293347.293350","journal-title":"J. ACM"},{"key":"9_CR8","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 79\u201388. ACM, New York (2006). Full version available at https:\/\/eprint.iacr.org\/2006\/210"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Meldgaard, S.: Perfectly secure oblivious RAM without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144\u2013163. Springer, Heidelberg (2011)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Evdokimov, S., Fischmann, M., Gunther, O.: Provable security for outsourcing database operations. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 117. IEEE (2006)","DOI":"10.1109\/ICDE.2006.121"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803\u2013815. Springer, Heidelberg (2005). http:\/\/dx.doi.org\/10.1007\/11523468_65"},{"key":"9_CR12","unstructured":"Goh, E.J.: Secure indexes. IACR Cryptology ePrint Archive 2003, 216 (2003). https:\/\/eprint.iacr.org\/2003\/216\/"},{"issue":"3","key":"9_CR13","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 43(3), 431\u2013473 (1996). http:\/\/doi.acm.org\/10.1145\/233551.233553","journal-title":"J. ACM"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious ram simulation with efficient worst-case access overhead. In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 95\u2013100. ACM (2011)","DOI":"10.1145\/2046660.2046680"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Haynberg, R., Rill, J., Achenbach, D., M\u00fcller-Quade, J.: Symmetric searchable encryption for exact pattern matching using directed acyclic word graphs. In: SECRYPT, pp. 403\u2013410 (2013)","DOI":"10.5220\/0004530004030410"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-40588-4_13","volume-title":"Security Engineering and Intelligence Informatics","author":"M Gabel","year":"2013","unstructured":"Gabel, M., Schulze, M., Huber, M., Bieber, A.: Cumulus4j: a provably secure database abstraction layer. In: Cuzzocrea, A., Kittl, C., Simos, D.E., Weippl, E., Xu, L. (eds.) CD-ARES Workshops 2013. LNCS, vol. 8128, pp. 180\u2013193. Springer, Heidelberg (2013)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-39884-1_22","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2013","unstructured":"Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258\u2013274. Springer, Heidelberg (2013)"},{"key":"9_CR18","series-title":"Chapman & Hall\/CRC Cryptography and Network Security Series","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC Cryptography and Network Security Series. Chapman & Hall\/CRC, New York\/Boca Raton (2007)"},{"key":"9_CR19","unstructured":"Kurosawa, K., Ohtaki, Y.: How to construct uc-secure searchable symmetric encryption scheme. Cryptology ePrint Archive, Report 2015\/251 (2015). http:\/\/eprint.iacr.org\/2015\/251"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, p. 364. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14623-7_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Reinman","year":"2010","unstructured":"Reinman, T., Pinkas, B.: Oblivious RAM revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 502\u2013519. Springer, Heidelberg (2010)"},{"key":"9_CR22","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., Stefanov, E., Li, M., Chan, T.-H.H.: 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":"9_CR23","unstructured":"Sion, R., Carbunar, B.: On the computational practicality of private information retrieval. In: Proceedings of the Network and Distributed Systems Security Symposium (2007)"},{"key":"9_CR24","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. Cryptology ePrint Archive, Report 2013\/832 (2013). http:\/\/eprint.iacr.org\/2013\/832"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Information Security in the Balkans"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29172-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:39:43Z","timestamp":1748745583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29172-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319291710","9783319291727"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29172-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}