{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:08:15Z","timestamp":1750910895782,"version":"3.41.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319678153"},{"type":"electronic","value":"9783319678160"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67816-0_15","type":"book-chapter","created":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T10:43:16Z","timestamp":1505212996000},"page":"257-274","source":"Crossref","is-referenced-by-count":10,"title":["Order-Preserving Encryption Using Approximate Integer Common Divisors"],"prefix":"10.1007","author":[{"given":"James","family":"Dyer","sequence":"first","affiliation":[]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,13]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et al.: Order preserving encryption for numeric data. In: Proceedings of the SIGMOD 2004, pp. 563\u2013574. ACM (2004)","DOI":"10.1145\/1007568.1007632"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., et al.: A concrete security treatment of symmetric encryption. In: Proceedings of the FOCS 1997, pp. 394\u2013403. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26\u201345. Springer, Heidelberg (1998). doi: 10.1007\/BFb0055718"},{"key":"15_CR4","unstructured":"Boelter, T., et al.: A secure one-roundtrip index for range queries. Cryptology ePrint Archive: 2016\/568 (2016)"},{"key":"15_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. 6841, pp. 578\u2013595. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22792-9_33"},{"key":"15_CR6","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. 5479, pp. 224\u2013241. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-01001-9_13"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-46803-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"D Boneh","year":"2015","unstructured":"Boneh, D., Lewi, K., Raykova, M., Sahai, A., Zhandry, M., Zimmerman, J.: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 563\u2013594. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46803-6_19"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nguyen, P.Q.: Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers. Cryptology ePrint Archive: 2011\/436 (2011)","DOI":"10.1007\/978-3-642-29011-4_30"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-29011-4_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Nguyen, P.Q.: Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 502\u2013519. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29011-4_30"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-662-52993-5_24","volume-title":"Fast Software Encryption","author":"N Chenette","year":"2016","unstructured":"Chenette, N., Lewi, K., Weis, S.A., Wu, D.J.: Practical order-revealing encryption with limited leakage. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 474\u2013493. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-52993-5_24"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. In: Proceedings of the ANTS-X, vol. 1, pp. 271\u2013293. Mathematical Sciences Publishers (2012)","DOI":"10.2140\/obs.2013.1.271"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-22792-9_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J-S Coron","year":"2011","unstructured":"Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487\u2013504. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22792-9_28"},{"key":"15_CR13","unstructured":"Dautelle, J.-M.: JScience. Version 4.3.1, September 2014. http:\/\/jscience.org"},{"key":"15_CR14","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","year":"2010","unstructured":"Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13190-5_2"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Durak, F.B., et al.: What else is revealed by order-revealing encryption? In: Proceedings of the CCS 2016, pp. 1155\u20131166. ACM (2016)","DOI":"10.1145\/2976749.2978379"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Dyer, J., et al.: Practical homomorphic encryption over the integers. arXiv:1702.07588 [cs.CR], February 2017","DOI":"10.1007\/978-3-319-71045-7_3"},{"issue":"A","key":"15_CR17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1112\/S1461157016000218","volume":"19","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., et al.: Algorithms for the approximate common divisor problem. LMS J. Comput. Math. 19(A), 58\u201372 (2016)","journal-title":"LMS J. Comput. Math."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44670-2_6","volume-title":"Cryptography and Lattices","author":"N Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.: Approximate integer common divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 51\u201366. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44670-2_6"},{"issue":"9","key":"15_CR19","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 Trans. Inf. Syst. 93(9), 2520\u20132533 (2010)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Frequency-hiding order-preserving encryption. In: Proceedings of the CCS 2015, pp. 656\u2013667. ACM (2015)","DOI":"10.1145\/2810103.2813629"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F., Schroepfer, A.: Optimal average-complexity ideal-security order-preserving encryption. In: Proceedings of the CCS 2014, pp. 275\u2013286. ACM (2014)","DOI":"10.1145\/2660267.2660277"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Krendelev, S.F., et al.: Order-preserving encryption schemes based on arithmetic coding and matrices. In: Proceedings of the FedCSIS 2014, pp. 891\u2013899. PTI (2014)","DOI":"10.15439\/2014F186"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Lewi, K., Wu, D.J.: Order-revealing encryption: new constructions, applications, and lower bounds. In: Proceedings of the CCS 2016, pp. 1167\u20131178. ACM (2016)","DOI":"10.1145\/2976749.2978376"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Liu, D., Wang, S.: Programmable order-preserving secure index for encrypted database query. In: Proceedings of the CLOUD 2012, pp. 502\u2013509. IEEE (2012)","DOI":"10.1109\/CLOUD.2012.65"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jnca.2014.07.001","volume":"59","author":"Z Liu","year":"2016","unstructured":"Liu, Z., et al.: New order preserving encryption model for outsourced databases in cloud environments. J. Netw. Comput. Appl. 59, 198\u2013207 (2016)","journal-title":"J. Netw. Comput. Appl."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Massey, J.L.: Guessing and entropy. In: Proceedings of the ISIT 1994, p. 204. IEEE (1994)","DOI":"10.1109\/ISIT.1994.394764"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Naveed, M., et al.: Inference attacks on property-preserving encrypted databases. In: Proceedings of the CCS 2015, pp. 644\u2013655. ACM (2015)","DOI":"10.1145\/2810103.2813651"},{"key":"15_CR28","unstructured":"O\u2019Malley, O.: TeraByte sort on Apache Hadoop. Technical report, Yahoo, Inc., pp. 1\u20133, May 2008. http:\/\/sortbenchmark.org\/YahooHadoop.pdf"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Popa, R.A., et al.: An ideal-security protocol for order-preserving encoding. In: Proceedings of the SP 2013, pp. 463\u2013477. IEEE (2013)","DOI":"10.1109\/SP.2013.38"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Popa, R.A., et al.: CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of the SOSP 2011, pp. 85\u2013100. ACM (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"15_CR31","unstructured":"Popa, R.A., et al.: CryptDB, March 2014. https:\/\/css.csail.mit.edu\/cryptdb\/"},{"issue":"11","key":"15_CR32","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., et al.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-662-45608-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"I Teranishi","year":"2014","unstructured":"Teranishi, I., Yung, M., Malkin, T.: Order-preserving encryption secure beyond one-wayness. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 42\u201361. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45608-8_3"},{"key":"15_CR34","unstructured":"The Apache Software Foundation: Commons Math: The Apache Commons Mathematics Library. Version 3.6.1, August 2016. http:\/\/commons.apache.org\/proper\/commons-math\/"},{"key":"15_CR35","unstructured":"Xiao, L., Yen, I.-L.: A note for the ideal order-preserving encryption object and generalized order-preserving encryption. Cryptology ePrint Archive: 2012\/350 (2012)"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Xiao, L., Yen, I.-L.: Security analysis for order preserving encryption schemes. In: Proceedings of the CISS 2012, pp. 1\u20136. IEEE (2012)","DOI":"10.1109\/CISS.2012.6310814"},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-27890-7_7","volume-title":"Information Security Applications","author":"DH Yum","year":"2012","unstructured":"Yum, D.H., Kim, D.S., Kim, J.S., Lee, P.J., Hong, S.J.: Order-preserving encryption for non-uniformly distributed plaintexts. In: Jung, S., Yung, M. (eds.) WISA 2011. LNCS, vol. 7115, pp. 84\u201397. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-27890-7_7"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management, Cryptocurrencies and Blockchain Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67816-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T18:10:16Z","timestamp":1750875016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67816-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319678153","9783319678160"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67816-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}