{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:23:07Z","timestamp":1725985387149},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977942"},{"type":"electronic","value":"9783319977959"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97795-9_12","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T16:07:17Z","timestamp":1532362037000},"page":"128-141","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Private Comparison Protocol and Its Application to Range Queries"],"prefix":"10.1007","author":[{"given":"Tushar Kanti","family":"Saha","sequence":"first","affiliation":[]},{"family":"Mayank","sequence":"additional","affiliation":[]},{"family":"Deevashwer","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Koshiba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Barker, E.: Recommendation for key management. In: NIST Special Publication 800\u201357 Part 1 Rev. 4, NIST (2016)","DOI":"10.6028\/NIST.SP.800-57pt1r4"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-38980-1_7","volume-title":"Applied Cryptography and Network Security","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Gentry, C., Halevi, S., Wang, F., Wu, D.J.: Private database queries using somewhat homomorphic encryption. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 102\u2013118. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_7"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from Ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TIFS.2015.2483486","volume":"11","author":"JH Cheon","year":"2016","unstructured":"Cheon, J.H., Kim, M., Kim, M.: Optimized search-and-compute circuits and their application to query evaluation on encrypted data. IEEE Trans. Inf. Forensics Secur. 11(1), 188\u2013199 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1504\/IJACT.2008.017048","volume":"1","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8ig\u00e5rd, M.: Homomorphic encryption and secure comparison. Int. J. Appl. Crypt. 1(1), 22\u201331 (2008)","journal-title":"Int. J. Appl. Crypt."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Symposium on Theory of Computing \u2013 STOC 2009, pp. 169\u2013178. ACM, New York (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"12_CR9","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). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_1"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-01307-2_48","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M Kantarcioglu","year":"2009","unstructured":"Kantarcioglu, M., Nix, R., Vaidya, J.: An efficient approximate protocol for privacy-preserving association rule mining. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 515\u2013524. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01307-2_48"},{"key":"12_CR11","unstructured":"Kim, M., Lee, H.T., Ling, S., Ren, S.Q., Tan, B.H.M., Wang, H.: Better security for queries on encrypted databases. IACR Cryptology ePrint Archive, 2016\/470 (2016)"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Kim, M., Lee, H.T., Ling, S., Wang, H.: On the efficiency of FHE-based private queries. IEEE Trans. Dependable and Secure Comput. (to appear). https:\/\/doi.org\/10.1109\/TDSC.2016.2568182","DOI":"10.1109\/TDSC.2016.2568182"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: ACM Workshop on Cloud Computing Security Workshop, CCSW 2011, pp. 113\u2013124. ACM, New York (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"12_CR14","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 \u2014 EUROCRYPT 1999","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. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Saha, T. K., Ali, A.B.M.S.: Storage cost minimizing in cloud - a proposed novel approach based on multiple key cryptography. In: 1st Asia-Pacific World Congress on Computer Science and Engineering (APWConCSE), pp. 1\u20139. IEEE (2014)","DOI":"10.1109\/APWCCSE.2014.7053856"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Saha, T. K., Koshiba, T.: Private equality test using ring-LWE somewhat homomorphic encryption, In: 3rd Asia-Pacific World Congress on Computer Science and Engineering (APWConCSE), pp. 1\u20139. IEEE (2016). https:\/\/doi.org\/10.1109\/APWC-on-CSE.2016.013","DOI":"10.1109\/APWC-on-CSE.2016.013"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-57339-7_9","volume-title":"Progress in Cryptology - AFRICACRYPT 2017","author":"TK Saha","year":"2017","unstructured":"Saha, T.K., Koshiba, T.: Private conjunctive query over encrypted data. In: Joye, M., Nitaj, A. (eds.) AFRICACRYPT 2017. LNCS, vol. 10239, pp. 149\u2013164. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57339-7_9"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-61176-1_19","volume-title":"Data and Applications Security and Privacy XXXI","author":"Tushar Kanti Saha","year":"2017","unstructured":"Saha, T.K., Mayank, Koshiba, T.: Efficient protocols for private database queries. In: Livraga, G., Zhu, S. (eds.) Data and Applications Security and Privacy XXXI. DBSec 2017. LNCS, vol. 10359, pp. 337\u2013348. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61176-1_19"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Saha, T. K., Koshiba, T.: Privacy-preserving equality test towards big data. In: Proceedings of the 10th International Symposium on Foundations & Practice of Security, FPS (2017)","DOI":"10.1007\/978-3-319-75650-9_7"},{"key":"12_CR20","series-title":"Lecture Notes on Data Engineering and Communications Technologies","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-319-65521-5_48","volume-title":"Advances in Network-Based Information Systems","author":"TK Saha","year":"2018","unstructured":"Saha, T.K., Koshiba, T.: An efficient privacy-preserving comparison protocol. In: Barolli, L., Enokido, T., Takizawa, M. (eds.) NBiS 2017. LNDECT, vol. 7, pp. 553\u2013565. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-65521-5_48"},{"key":"12_CR21","unstructured":"The PARI$$\\sim $$\u223cGroup, PARI\/GP version 2.7.5, Bordeaux (2014). http:\/\/pari.math.u-bordeaux.fr\/"},{"issue":"7","key":"12_CR22","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1109\/TIFS.2017.2675864","volume":"12","author":"K Xue","year":"2017","unstructured":"Xue, K., Li, S., Hong, J., Xue, Y., Yu, N., Hong, P.: Two-cloud secure database for numeric-related SQL range queries with privacy preserving. IEEE Trans. Inf. Forensics Secur. 12(7), 1596\u20131608 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-54568-9_3","volume-title":"Data Privacy Management and Autonomous Spontaneous Security","author":"M Yasuda","year":"2014","unstructured":"Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., Koshiba, T.: Practical Packing Method in Somewhat Homomorphic Encryption. In: Garcia-Alfaro, J., Lioudakis, G., Cuppens-Boulahia, N., Foley, S., Fitzgerald, W.M. (eds.) DPM\/SETOP -2013. LNCS, vol. 8247, pp. 34\u201350. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54568-9_3"}],"container-title":["Lecture Notes in Computer Science","Internet and Distributed Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97795-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T05:14:45Z","timestamp":1571634885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97795-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977942","9783319977959"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97795-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}