{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:04:40Z","timestamp":1746331480094,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439357"},{"type":"electronic","value":"9783662439364"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43936-4_20","type":"book-chapter","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T12:05:04Z","timestamp":1403870704000},"page":"307-323","source":"Crossref","is-referenced-by-count":8,"title":["Randomly Partitioned Encryption for Cloud Databases"],"prefix":"10.1007","author":[{"given":"Tahmineh","family":"Sanamrad","sequence":"first","affiliation":[]},{"given":"Lucas","family":"Braun","sequence":"additional","affiliation":[]},{"given":"Donald","family":"Kossmann","sequence":"additional","affiliation":[]},{"given":"Ramarathnam","family":"Venkatesan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et al.: Order preserving encryption for numeric data. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 563\u2013574. ACM (2004)","DOI":"10.1145\/1007568.1007632"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/335191.335438","volume":"29","author":"R. Agrawal","year":"2000","unstructured":"Agrawal, R., et al.: Privacy-preserving data mining. ACM Sigmod Record\u00a029(2), 439\u2013450 (2000)","journal-title":"ACM Sigmod Record"},{"key":"20_CR3","unstructured":"Arasu, A., et al.: Orthogonal Security with Cipherbase. In: CIDR. Citeseer (2013)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bajaj, S., et al.: TrustedDB: a trusted hardware based database with privacy and data confidentiality. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 205\u2013216. ACM (2011)","DOI":"10.1145\/1989323.1989346"},{"key":"20_CR5","unstructured":"Berger, B., et al.: Approximation alogorithms for the maximum acyclic subgraph problem. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 236\u2013243. Society for Industrial and Applied Mathematics (1990)"},{"key":"20_CR6","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":"20_CR7","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":"20_CR8","doi-asserted-by":"crossref","unstructured":"Chow, R., et al.: Controlling data in the cloud: outsourcing computation without outsourcing control. In: Proceedings of the 2009 ACM Workshop on Cloud Computing Security, pp. 85\u201390. ACM (2009)","DOI":"10.1145\/1655008.1655020"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Damiani, E., et al.: Balancing confidentiality and efficiency in untrusted relational DBMSs. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 93\u2013102. ACM (2003)","DOI":"10.1145\/948121.948124"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-30073-1_3","volume-title":"Secure Data Management","author":"Y. Elovici","year":"2004","unstructured":"Elovici, Y., Waisenberg, R., Shmueli, E., Gudes, E.: A structure preserving database encryption scheme. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2004. LNCS, vol.\u00a03178, pp. 28\u201340. Springer, Heidelberg (2004)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis. Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami, V., et al.: Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph. In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 573\u2013582. IEEE (2008)","DOI":"10.1109\/FOCS.2008.51"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Hacig\u00fcm\u00fc\u015f, H., et al.: Executing SQL over encrypted data in the database-service-provider model. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 216\u2013227. ACM (2002)","DOI":"10.1145\/564716.564717"},{"key":"20_CR15","unstructured":"Hildenbrand, S., et al.: Query processing on encrypted data in the cloud. Tech. rep. 735. Department of Computer Science, ETH Zurich (2011)"},{"key":"20_CR16","unstructured":"Hsueh, S.: Database encryption in SQL server 2008 enterprise edition. Microsoft, SQL Server Technical Article (2008)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Kadhem, H., et al.: A Secure and Efficient Order Preserving Encryption Scheme for Relational Databases. In: KMIS, pp. 25\u201335 (2010)","DOI":"10.5220\/0003095700250035"},{"issue":"9","key":"20_CR18","doi-asserted-by":"publisher","first-page":"2520","DOI":"10.1587\/transinf.E93.D.2520","volume":"93","author":"H. Kadhem","year":"2010","unstructured":"Kadhem, H., et al.: MV-OPES: Multivalued-order preserving encryption scheme: A novel scheme for encrypting integer value to many different values. IEICE Transactions on Information and Systems\u00a093(9), 2520\u20132533 (2010)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Katz, J., et al.: Introduction to modern cryptography: principles and protocols. CRC Press (2007)","DOI":"10.1201\/9781420010756"},{"key":"20_CR20","unstructured":"Malkin, T., et al.: Order-Preserving Encryption Secure Beyond One-Wayness. Tech. rep. Citeseer (2013)"},{"key":"20_CR21","unstructured":"Nanda, A.: Transparent Data Encryption. Oracle Magazine (2005)"},{"key":"20_CR22","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":"20_CR23","doi-asserted-by":"crossref","unstructured":"Popa, R.A., et al.: An ideal-security protocol for order-preserving encoding. In: 2013 IEEE Symposium on Security and Privacy (SP), pp. 463\u2013477. IEEE (2013)","DOI":"10.1109\/SP.2013.38"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Popa, R.A., et al.: Cryptdb: protecting confidentiality with encrypted query processing. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pp. 85\u2013100. ACM (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"20_CR25","unstructured":"Sanamrad, T., et al.: POP: a new encryption scheme for dynamic databases. Tech. rep. 782. Department of Computer Science, ETH Zurich (2013)"},{"issue":"11","key":"20_CR26","first-page":"2207","volume":"92","author":"L. Seungmin","year":"2009","unstructured":"Seungmin, L., et al.: Chaotic order preserving encryption for efficient and secure queries on databases. IEICE Transactions on Information and Systems\u00a092(11), 2207\u20132217 (2009)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"20_CR27","unstructured":"Sion, R.: Secure data outsourcing. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 1431\u20131432. VLDB Endowment (2007)"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"N.P. Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Tu, S., et al.: Processing analytical queries over encrypted data. In: Proceedings of the 39th International Conference on Very Large Data Bases, pp. 289\u2013300. VLDB Endowment (2013)","DOI":"10.14778\/2535573.2488336"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"20_CR31","unstructured":"Wang, H., et al.: Efficient secure query evaluation over encrypted XML databases. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 127\u2013138. VLDB Endowment (2006)"},{"key":"20_CR32","unstructured":"Wang, S., et al.: Is Homomorphic Encryption the Holy Grail for Database Queries on Encrypted Data? Technical report, Department of Computer Science, UCSB (2012)"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Wozniak, S., et al.: Beyond the ideal object: towards disclosure-resilient order-preserving encryption schemes. In: Proceedings of the 2013 ACM Workshop on Cloud Computing Security Workshop, pp. 89\u2013100. ACM (2013)","DOI":"10.1145\/2517488.2517496"},{"key":"20_CR34","unstructured":"Xiao, L., et al.: A Note for the Ideal Order-Preserving Encryption Object and Generalized Order-Preserving Encryption. In: IACR Cryptology ePrint Archive 2012, p. 350 (2012)"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/11863908_29","volume-title":"Computer Security \u2013 ESORICS 2006","author":"Z. Yang","year":"2006","unstructured":"Yang, Z., Zhong, S., Wright, R.N.: Privacy-preserving queries on encrypted data. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol.\u00a04189, pp. 479\u2013495. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXVIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43936-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T13:48:55Z","timestamp":1746280135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43936-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439357","9783662439364"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43936-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}