{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:46:00Z","timestamp":1725763560596},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452031"},{"type":"electronic","value":"9783642452048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45204-8_2","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T07:04:25Z","timestamp":1386745465000},"page":"14-26","source":"Crossref","is-referenced-by-count":5,"title":["An Encrypted In-Memory Column-Store: The Onion Selection Problem"],"prefix":"10.1007","author":[{"given":"Florian","family":"Kerschbaum","sequence":"first","affiliation":[]},{"given":"Martin","family":"H\u00e4rterich","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Kohler","sequence":"additional","affiliation":[]},{"given":"Isabelle","family":"Hang","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Schaad","sequence":"additional","affiliation":[]},{"given":"Axel","family":"Schr\u00f6pfer","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Tighzert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD) (2004)","DOI":"10.1145\/1007568.1007632"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 535\u2013552. Springer, Heidelberg (2007)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Blaze","year":"1998","unstructured":"Blaze, M., Bleumer, G., Strauss, M.J.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 127\u2013144. Springer, Heidelberg (1998)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-01001-9_13","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"A. Boldyreva","year":"2009","unstructured":"Boldyreva, A., Chenette, N., Lee, Y., O\u2019Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 224\u2013241. Springer, Heidelberg (2009)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-22792-9_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A. Boldyreva","year":"2011","unstructured":"Boldyreva, A., Chenette, N., O\u2019Neill, A.: Order-preserving encryption revisited: improved security analysis and alternative solutions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 578\u2013595. Springer, Heidelberg (2011)"},{"key":"2_CR6","doi-asserted-by":"crossref","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)","DOI":"10.1145\/1180405.1180417"},{"key":"2_CR7","unstructured":"F\u00e4rber, F., May, N., Lehner, W., Groe, P., M\u00fcller, I., Rauhe, H., Dees, J.: The SAP HANA database \u2013 an architecture overview. IEEE Data Engineering Bulletin\u00a035(1) (2012)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and Systems Sciences\u00a028(2) (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hacig\u00fcm\u00fcs, H., Iyer, B., Li, C., Mehrotra, S.: Executing SQL over encrypted data in the database-service-provider model. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD) (2002)","DOI":"10.1145\/564716.564717"},{"key":"2_CR10","unstructured":"Hacig\u00fcm\u00fcs, H., Iyer, B., Mehrotra, S.: Providing database as a service. In: Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE) (2002)"},{"key":"2_CR11","unstructured":"Islam, M., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: Proceedings of the 19th Network and Distributed System Security Symposium (NDSS) (2012)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 19th ACM Conference on Computer and Communications Security (CCS) (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Building a privacy-preserving benchmarking enterprise system. Enterprise Information Systems\u00a02(4) (2008)","DOI":"10.1080\/17517570802372468"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Automatically optimizing secure computation. In: Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS) (2011)","DOI":"10.1145\/2046707.2046786"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F., Grofig, P., Hang, I., H\u00e4rterich, M., Kohler, M., Schaad, A., Schr\u00f6pfer, A., Tighzert, W.: Demo: Adjustably encrypted in-memory column-store. In: Proceedings of the 20th ACM Conference on Computer and Communications Security (CCS) (2013)","DOI":"10.1145\/2508859.2512491"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-39256-6_13","volume-title":"Data and Applications Security and Privacy XXVII","author":"F. Kerschbaum","year":"2013","unstructured":"Kerschbaum, F., H\u00e4rterich, M., Grofig, P., Kohler, M., Schaad, A., Schr\u00f6pfer, A., Tighzert, W.: Optimal re-encryption strategy for joins in encrypted databases. In: Wang, L., Shafiq, B. (eds.) DBSec 2013. LNCS, vol.\u00a07964, pp. 195\u2013210. Springer, Heidelberg (2013)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11766155_29","volume-title":"Emerging Trends in Information and Communication Security","author":"F. Kerschbaum","year":"2006","unstructured":"Kerschbaum, F., Terzidis, O.: Filtering for private collaborative benchmarking. In: M\u00fcller, G. (ed.) ETRICS 2006. LNCS, vol.\u00a03995, pp. 409\u2013422. Springer, Heidelberg (2006)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Pibernik, R., Zhang, Y., Kerschbaum, F., Schr\u00f6pfer, A.: Secure collaborative supply chain planning and inverse optimization-the jels model. European Journal of Operational Research\u00a0208(1) (2011)","DOI":"10.1016\/j.ejor.2010.08.018"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory\u00a024 (1978)","DOI":"10.1109\/TIT.1978.1055817"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Popa, R., Li, F., Zeldovich, N.: An ideal-security protocol for order-preserving encoding. In: Proceedings of the 34th IEEE Symposium on Security and Privacy (SP) (2013)","DOI":"10.1109\/SP.2013.38"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Popa, R., Redfield, C., Zeldovich, N., Balakrishnan, H.: CryptDB: Protecting confidentiality with encrypted query processing. In: Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP) (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Shi, E., Bethencourt, J., Chan, H., Song, D., Perrig, A.: Multi-dimensional range query over encrypted data. In: Proceedings of the 28th IEEE Symposium on Security and Privacy (SP) (2007)","DOI":"10.1109\/SP.2007.29"},{"key":"2_CR24","unstructured":"Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the 21st IEEE Symposium on Security and Privacy, SP (2000)"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45204-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T11:15:07Z","timestamp":1558782907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45204-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452031","9783642452048"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45204-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}