{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:57:52Z","timestamp":1706061472802},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transcom.2015ebp3359","type":"journal-article","created":{"date-parts":[[2016,4,30]],"date-time":"2016-04-30T22:09:34Z","timestamp":1462054174000},"page":"1070-1086","source":"Crossref","is-referenced-by-count":6,"title":["Sorting Method for Fully Homomorphic Encrypted Data Using the Cryptographic Single-Instruction Multiple-Data Operation"],"prefix":"10.23919","volume":"E99.B","author":[{"given":"Pyung","family":"KIM","sequence":"first","affiliation":[{"name":"KAIST"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Younho","family":"LEE","sequence":"additional","affiliation":[{"name":"SeoulTech"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunsoo","family":"YOON","sequence":"additional","affiliation":[{"name":"KAIST"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] A. Chatterjee, M. Kaushal, and I. Sengupta, \u201cAccelerating sorting of fully homomorphic encrypted data,\u201d Progress in Cryptology, INDOCRYPT 2013, Lecture Notes in Computer Science, vol.8250, pp.262-273, 2013.","DOI":"10.1007\/978-3-319-03515-4_17"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] G.S. Cetin, Y. Doroz, B. Sunar, and E. Savas, \u201cLow depth circuits for efficient homomorphic sorting,\u201d In IACR ePrint Arch. 2015\/274, March 2015 (available at: https:\/\/eprint.iacr.org\/2015\/274 ).","DOI":"10.1007\/978-3-319-22174-8_4"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] K.E. Batcher, \u201cSorting networks and their applications,\u201d Proc. AFIPS Spring Joint Computer Conference, AFIPS'68 (Spring), pp.307-314, 1968.","DOI":"10.1145\/1468075.1468121"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N.P. Smart and F. Vercauteren, \u201cFully homomorphic SIMD operations,\u201d Des. Codes Cryptogr., vol.71, no.1, pp.57-81, April 2014.","DOI":"10.1007\/s10623-012-9720-4"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Z. Brakerski, C. Gentry, and V. Vaikuntanathan, \u201c(Leveled) fully homomorphic encryption without bootstrapping,\u201d Proc. Conference on 3rd Innovations in Theoretical Computer Science, ITCS'12, pp.309-325, 2012.","DOI":"10.1145\/2090236.2090262"},{"key":"6","unstructured":"[6] C. Gentry, S. Halevi, and N.P. Smart, \u201cFully homomorphic encryption with polylog overhead,\u201d Advances in Cryptology, EUROCRYPT 2012, Lecture Notes in Computer Science, vol.7237, pp.465-482, 2012."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] S. Halevi and V. Shoup, \u201cAlgorithms in HElib,\u201d Advances in Cryptology, CRYPTO 2014, Lecture Notes in Computer Science, vol.8616, pp.554-571, 2014.","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"8","unstructured":"[8] S. Halevi and V. Shoup, \u201cDesign and implementation of a homomorphic encryption library,\u201d available at https:\/\/github.com\/shaih\/HElib, 2013."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S. Halevi and V. Shoup, \u201cBootstrapping for HElib,\u201d Advances in Cryptology, EUROCRYPT 2015, Lecture Notes in Computer Science, vol.9056, pp.641-670, 2015.","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"10","unstructured":"[10] R. Rivest, L. Adleman, and M. Dertouzos, \u201cOn data banks and privacy homomorphisms,\u201d In Found. of Secure Comput., vol.4, no.11, pp.169-180, 1978."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] S. Goldwasser and S. Micali, \u201cProbabilistic encryption & how to play mental poker keeping secret all partial information,\u201d Proc. fourteenth Annual ACM Symposium on Theory of Computing, STOC'82, pp.365-377, 1982.","DOI":"10.1145\/800070.802212"},{"key":"12","unstructured":"[12] J. Benaloh, Verifiable secret-ballot elections, Ph.D. thesis, Yale Univ., Dept. of CompSci., 1988."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] D. Naccache and J. Stern, \u201cA new public key cryptosystem based on higher residues,\u201d Proc. 5th ACM Conference on Computer and Communications Security, CCS'98, pp.59-66, 1998.","DOI":"10.1145\/288090.288106"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] T. Okamoto and S. Uchiyama, \u201cA new public-key cryptosystem as secure as factoring,\u201d Advances in Cryptology, EUROCRYPT'98, Lecture Notes in Computer Science, vol.1403, pp.308-318, 1998.","DOI":"10.1007\/BFb0054135"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] P. Paillier, \u201cPublic-key cryptosystems based on composite degree Residuosity classes,\u201d Proc. Eurocrypt'99, LNCS 1592, pp.223-238, 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] I. Damg\u00f8ard and M. Jurik, \u201cA length-flexible threshold cryptosystem with applications,\u201d Information Security and Privacy, Lecture Notes in Computer Science, vol.2727, pp.350-364, 2003.","DOI":"10.1007\/3-540-45067-X_30"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] T. El Gamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithms,\u201d Proc. CRYPTO'84, pp.10-18, 1985.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] D. Boneh, E.-J. Goh, and K. Nissim, \u201cEvaluating 2-DNF formulas on ciphertexts,\u201d Theory of Cryptography, Lecture Notes in Computer Science, vol.3378, pp.325-341, 2005.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] M. Fellows and N. Koblitz, \u201cCombinatorial cryptosystems galore!,\u201d Finite Fields: Theory, Applications, and Algorithms, Contemporary Mathematics, vol.168, pp.51-61, 1994.","DOI":"10.1090\/conm\/168\/01688"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] C. Gentry, \u201cFully homomorphic encryption using ideal lattices,\u201d Proc. 41st Annual ACM Symposium on Symposium on Theory of Computing, STOC'09, pp.169-178, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] J.H. Cheon, J.-S. Coron, J. Kim, M.S. Lee, T. Lepoint, M. Tibouchi, and A. Yun, \u201cBatch fully homomorphic encryption over the integers,\u201d Advances in Cryptology, EUROCRYPT 2013, Lecture Notes in Computer Science, vol.7881, pp.315-335, 2013.","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] J. Alperin-Sheriff and C. Peikert, \u201cFaster bootstrapping with polynomial error,\u201d Advances in Cryptology, CRYPTO 2014, Lecture Notes in Computer Science, vol.8616, pp.297-314, 2014.","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] Z. Brakerski, \u201cFully homomorphic encryption without modulus switching from classical GapSVP,\u201d Advances in Cryptology, CRYPTO 2012, Lecture Notes in Computer Science, vol.7417, pp.868-886, 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] Z. Brakerski, C. Gentry, and S. Halevi, \u201cPacked ciphertexts in LWE-based homomorphic encryption,\u201d Public-Key Cryptography, PKC 2013, Lecture Notes in Computer Science, vol.7778, pp.1-13, 2013.","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] Z. Brakerski and V. Vaikuntanathan, \u201cLattice-based FHE as secure as PKE,\u201d Proc. 5th Conference on Innovations in Theoretical Computer Science, ITCS'14, pp.1-12, 2014.","DOI":"10.1145\/2554797.2554799"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] C. Gentry, S. Halevi, and N.P. Smart, \u201cFully homomorphic encryption with polylog overhead,\u201d Advances in Cryptology, EUROCRYPT 2012, Lecture Notes in Computer Science, vol.7237, pp.465-482, 2012.","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] C. Gentry, S. Halevi, and N.P. Smart, \u201cHomomorphic evaluation of the AES circuit,\u201d Advances in Cryptology, CRYPTO 2012, Lecture Notes in Computer Science, vol.7417, pp.850-867, 2012.","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] C. Gentry, A. Sahai, and B. Waters, \u201cHomomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based,\u201d Advances in Cryptology, CRYPTO 2013, Lecture Notes in Computer Science, vol.8042, pp.75-92, 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] N. Howgrave-Graham, \u201cApproximate integer common divisors,\u201d Cryptography and Lattices, Lecture Notes in Computer Science, vol.2146, pp.51-66, 2001.","DOI":"10.1007\/3-540-44670-2_6"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] J.-S. Coron, T. Lepoint, and M. Tibouchi, \u201cScale-invariant fully homomorphic encryption over the integers,\u201d Public-Key Cryptography, PKC 2014, Lecture Notes in Computer Science, vol.8383, pp.311-328, 2014.","DOI":"10.1007\/978-3-642-54631-0_18"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] J.-S. Coron, A. Mandal, D. Naccache, and M. Tibouchi, \u201cFully homomorphic encryption over the integers with shorter public keys,\u201d Advances in Cryptology, CRYPTO 2011, Lecture Notes in Computer Science, vol.6841, pp.487-504, 2011.","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] J.-S. Coron, D. Naccache, and M. Tibouchi, \u201cPublic key compression and modulus switching for fully homomorphic encryption over the integers,\u201d Advances in Cryptology, EUROCRYPT 2012, Lecture Notes in Computer Science, vol.7237, pp.446-464, 2012.","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, \u201cFully homomorphic encryption over the integers,\u201d Advances in Cryptology, EUROCRYPT 2010, Lecture Notes in Computer Science, vol.6110, pp.24-43, 2010.","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] J.H. Cheon and D. Stehl\u00e9, \u201cFully homomophic encryption over the integers revisited,\u201d Advances in Cryptology, EUROCRYPT 2015, Lecture Notes in Computer Science, vol.9056, pp.513-536, 2015.","DOI":"10.1007\/978-3-662-46800-5_20"},{"key":"35","unstructured":"[35] N. Wirth, Algorithms and Data Structures, pp.81-82, ISBN 0130220051, Prentice-Hall, Upper Saddle River, NJ, 1986."},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] F. Baldimtsi and O. Ohrimenko, \u201cSorting and searching behind the curtain,\u201d Financial Cryptography and Data Security, Lecture Notes in Computer Science, vol.8975, pp.127-146, 2015.","DOI":"10.1007\/978-3-662-47854-7_8"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] R. Bost, R.A. Popa, S. Tu, and S. Goldwasser, \u201cMachine learning classification over encrypted data,\u201d Proc. 2015 Network and Distributed System Security Symposium, 2015.","DOI":"10.14722\/ndss.2015.23241"},{"key":"38","unstructured":"[38] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Sorting Networks, in Introduction to Algorithms, Second Ed., Chap. 27, pp.704-724, ISBN 0-262-03293-7, MIT Press and McGraw-Hill, 1990."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/5\/E99.B_2015EBP3359\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:59:29Z","timestamp":1704898769000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/5\/E99.B_2015EBP3359\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2015ebp3359","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}