{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:00:17Z","timestamp":1775638817617,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319221731","type":"print"},{"value":"9783319221748","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-22174-8_4","type":"book-chapter","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T16:28:06Z","timestamp":1439569686000},"page":"61-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Depth Optimized Efficient Homomorphic Sorting"],"prefix":"10.1007","author":[{"given":"Gizem S.","family":"\u00c7etin","sequence":"first","affiliation":[]},{"given":"Yark\u0131n","family":"Dor\u00f6z","sequence":"additional","affiliation":[]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[]},{"given":"Erkay","family":"Sava\u015f","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference, AFIPS 1968 (Spring), pp. 307\u2013314. ACM, New York (1968). http:\/\/doi.acm.org\/10.1145\/1468075.1468121","DOI":"10.1145\/1468075.1468121"},{"key":"4_CR2","unstructured":"Bos, J.W., Lauter, K., Naehrig, M.: Private predictive analysis on encrypted medical data. Technical report MSR-TR-2013-81, September 2013. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=200652"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-45239-0_4","volume-title":"Cryptography and Coding","author":"JW Bos","year":"2013","unstructured":"Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 45\u201364. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-642-45239-0_4"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapSVP. IACR Cryptology ePrint Archive 2012, 78 (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. Electronic Colloquium on Computational Complexity (ECCC) 18, 111 (2011)","DOI":"10.1145\/2090236.2090262"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97\u2013106 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"4_CR7","unstructured":"Brenner, M., Perl, H., Smith, M.: libscarab software library. https:\/\/hcrypt.com\/"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-03515-4_17","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"A Chatterjee","year":"2013","unstructured":"Chatterjee, A., Kaushal, M., Sengupta, I.: Accelerating sorting of fully homomorphic encrypted data. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 262\u2013273. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-319-03515-4_17"},{"key":"4_CR9","unstructured":"Cheon, J.H., Kim, M., Lauter K.: Secure dna-sequence analysis on encrypted DNA nucleotides. http:\/\/media.eurekalert.org\/aaasnewsroom\/MCM\/FIL_000000001439\/EncryptedSW.pdf"},{"key":"4_CR10","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 van Dijk","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. 6110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"4_CR11","unstructured":"Dor\u00f6z, Y., Hu, Y., Sunar, B.: Homomorphic AES evaluation using NTRU (2014). http:\/\/eprint.iacr.org\/2014\/039.pdf, iACR ePrint Archive"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-44774-1_16","volume-title":"Financial Cryptography and Data Security","author":"Y Dor\u00f6z","year":"2014","unstructured":"Dor\u00f6z, Y., Sunar, B., Hammouri, G.: Bandwidth efficient PIR from NTRU. In: B\u00f6hme, R., Brenner, M., Moore, T., Smith, M. (eds.) FC 2014 Workshops. LNCS, vol. 8438, pp. 195\u2013207. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10.1007\/978-3-662-44774-1_16"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: A cost-effective pay-per-multiplication comparison method for millionaires (2001)","DOI":"10.1007\/3-540-45353-9_33"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing Gentry\u2019s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129\u2013148. Springer, Heidelberg (2011)"},{"key":"4_CR17","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. IACR Cryptology ePrint Archive Report 2011\/566 (2011). http:\/\/eprint.iacr.org\/"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. IACR Cryptology ePrint Archive 2012 (2012)","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 365\u2013377. ACM, New York (1982). http:\/\/doi.acm.org\/10.1145\/800070.802212","DOI":"10.1145\/800070.802212"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-37682-5_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"T Graepel","year":"2013","unstructured":"Graepel, T., Lauter, K., Naehrig, M.: ML confidential: machine learning on encrypted data. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 1\u201321. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-642-37682-5_1"},{"key":"4_CR21","unstructured":"Knuth, D.E.: The Art of Computer Programming, Fundamental Algorithms, vol. 1, 3rd edn. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/MSP.2012.2219653","volume":"30","author":"R Lagendijk","year":"2013","unstructured":"Lagendijk, R., Erkin, Z., Barni, M.: Encrypted signal processing for privacy protection: conveying the utility of homomorphic encryption and multiparty computation. IEEE Sig. Process. Mag. 30(1), 82\u2013105 (2013)","journal-title":"IEEE Sig. Process. Mag."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical. In: Cloud Computing Security Workshop, pp. 113\u2013124 (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Lauter, K., Lopez-Alt, A., Naehrig, M.: Private computation on encrypted genomic data. Technical report MSR-TR-2014-93, June 2014. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=219979","DOI":"10.1007\/978-3-319-16295-9_1"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: STOC (2012)","DOI":"10.1145\/2213977.2214086"},{"key":"4_CR26","unstructured":"L\u00f3pez-Alt, A., Naehrig, M.: Large integer plaintexts in ring-based fully homomorphic encryption (2014, in preparation)"},{"key":"4_CR27","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169\u2013180 (1978)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for nc1. In: 40th Annual Symposium on Foundations of Computer Science, pp. 554\u2013566 (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"4_CR29","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. IACR Cryptology ePrint Archive 2011, 133 (2011)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011)"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 206\u2013215. ACM, New York (2003). http:\/\/doi.acm.org\/10.1145\/956750.956776","DOI":"10.1145\/775047.775142"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982, pp. 160\u2013164. IEEE Computer Society, Washington, DC (1982). http:\/\/dx.doi.org\/10.1109\/SFCS.1982.88","DOI":"10.1109\/SFCS.1982.38"},{"issue":"1","key":"4_CR33","doi-asserted-by":"publisher","first-page":"46","DOI":"10.4018\/jdwm.2011010103","volume":"7","author":"CB Yildizli","year":"2011","unstructured":"Yildizli, C.B., Pedersen, T., Saygin, Y., Savas, E., Levi, A.: Distributed privacy preserving clustering via homomorphic secret sharing and its application to vertically partitioned spatio-temporal data. Int. J. Data Warehous. Min. 7(1), 46\u201366 (2011). http:\/\/dx.doi.org\/10.4018\/jdwm.2011010103","journal-title":"Int. J. Data Warehous. Min."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology -- LATINCRYPT 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22174-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:31:09Z","timestamp":1748565069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22174-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221731","9783319221748"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22174-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}