{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:12:15Z","timestamp":1750911135330,"version":"3.41.0"},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016inp0011","type":"journal-article","created":{"date-parts":[[2017,9,30]],"date-time":"2017-09-30T22:24:29Z","timestamp":1506810269000},"page":"2319-2326","source":"Crossref","is-referenced-by-count":1,"title":["Private Similarity Searchable Encryption for Euclidean Distance"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Yuji","family":"UNAGAMI","sequence":"first","affiliation":[{"name":"Advanced Research Division, Panasonic Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natsume","family":"MATSUZAKI","sequence":"additional","affiliation":[{"name":"Faculty of Information Systems, University of Nagasaki"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shota","family":"YAMADA","sequence":"additional","affiliation":[{"name":"Information Technology Research Institute, National Institute of Advance Industrial Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nuttapong","family":"ATTRAPADUNG","sequence":"additional","affiliation":[{"name":"Information Technology Research Institute, National Institute of Advance Industrial Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"MATSUDA","sequence":"additional","affiliation":[{"name":"Information Technology Research Institute, National Institute of Advance Industrial Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goichiro","family":"HANAOKA","sequence":"additional","affiliation":[{"name":"Information Technology Research Institute, National Institute of Advance Industrial Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Y. Unagami, N. Matsuzaki, S. Yamada, N. Attrapadung, T. Matsuda, and G. Hanaoka, \u201cPrivate similarity searchable encryption for Euclidean distance,\u201d Proc. International Symposium on Information Theory and Its Applications, pp.754-758, Oct. 2016."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Abdalla, F. Bourse, A.D. Caro, and D. Pointcheval, \u201cSimple functional encryption schemes for inner products,\u201d Public-Key Cryptography, PKC 2015, Lecture Notes in Computer Science, vol.9020, pp.733-751, 2015. 10.1007\/978-3-662-46447-2_33","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J. Baek, R. Safavi-Naini, and W. Susilo, \u201cPublic key encryption with keyword search revisited,\u201d Computational Science and Its Applications, ICCSA 2008, Lecture Notes in Computer Science, vol.5072, pp.1249-1259, 2008. 10.1007\/978-3-540-69839-5_96","DOI":"10.1007\/978-3-540-69839-5_96"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] A. Bishop, A. Jain, and L. Kowalczyk, \u201cFunction-hiding inner product encryption,\u201d Advances in Cryptology, ASIACRYPT 2015, Lecture Notes in Computer Science, vol.9452, pp.470-491, 2015. 10.1007\/978-3-662-48797-6_20","DOI":"10.1007\/978-3-662-48797-6_20"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] D. Boneh, A. Sahai, and B. Waters, \u201cFunctional encryption: Definitions and challenges,\u201d Theory of Cryptography, TCC 2011, Lecture Notes in Computer Science, vol.6597, pp.253-273, 2011. 10.1007\/978-3-642-19571-6_16","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, \u201cPublic key encryption with keyword search,\u201d Advances in Cryptology, EUROCRYPT 2004, Lecture Notes in Computer Science, vol.3027, pp.506-522, 2004. 10.1007\/978-3-540-24676-3_30","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] D. Boneh and B. Waters, \u201cConjunctive, subset and range queries on encrypted data,\u201d Theory of Cryptography, TCC 2007, Lecture Notes in Computer Science, vol.4392, pp.535-554, 2007. 10.1007\/978-3-540-70936-7_29","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, \u201cSearchable symmetric encryption: Improved definitions and efficient constructions,\u201d Proc. 13th ACM Conference on Computer and Communications Security, CCS 2006, pp.79-88, 2006. 10.1145\/1180405.1180417","DOI":"10.1145\/1180405.1180417"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] P. Datta, R. Dutta, and S. Mukhopadhyay, \u201cFunctional encryption for inner product with full function privacy,\u201d Public-Key Cryptography, PKC 2016, Lecture Notes in Computer Science, vol.9614, pp.164-195, 2016. 10.1007\/978-3-662-49384-7_7","DOI":"10.1007\/978-3-662-49384-7_7"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] W. Du and M.J. Atallah, \u201cProtocols for secure remote database access with approximate matching,\u201d E-Commerce Security and Privacy, Advances in Information Security, vol.2, pp.87-111, 2001. 10.1007\/978-1-4615-1467-1_6","DOI":"10.1007\/978-1-4615-1467-1_6"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters, \u201cCandidate indistinguishability obfuscation and functional encryption for all circuits,\u201d Proc. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013, pp.40-49, 2013. 10.1109\/focs.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] C. Gentry, \u201cFully homomorphic encryption using ideal lattices,\u201d Proc. Forty-First Annual ACM Symposium on Theory of Computing, STOC 2009, pp.169-178, 2009. 10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] F. Guo, W. Susilo, and Y. Mu, \u201cPOSTER: Euclidean distance based encryption: How to embed fuzziness in biometric based encryption,\u201d Proc. ACM Conference on Computer and Communications Security, CCS 2014, pp.1430-1432, 2014. 10.1145\/2660267.2662372","DOI":"10.1145\/2660267.2662372"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] J. Katz, A. Sahai, and B. Waters, \u201cPredicate encryption supporting disjunctions, polynomial equations, and inner products,\u201d Advances in Cryptology, EUROCRYPT 2008, Lecture Notes in Computer Science, vol.4965, pp.146-162, 2008. 10.1007\/978-3-540-78967-3_9","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"15","unstructured":"[15] S. Laur and H. Lipmaa, \u201cOn private similarity search protocols,\u201d Proc. 9th Nordic Workshop on Secure IT Systems, pp.73-77, 2004."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] T. Okamoto and K. Takashima, \u201cFully secure functional encryption with general relations from the decisional linear assumption,\u201d Advances in Cryptology, CRYPTO 2010, Lecture Notes in Computer Science, vol.6223, pp.191-208, 2010. 10.1007\/978-3-642-14623-7_11","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"17","unstructured":"[17] A. Oosawa, R. Hisanaga, T. Inoue, T. Hoshino, and K. Shimura, \u201cDevelopment of \u201cSYNAPSE Case Match\u201d, content-based image retrieval system for supporting image diagnosis,\u201d Fuji Film research & development, no.58-2013."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] E. Shen, E. Shi, and B. Waters, \u201cPredicate privacy in encryption systems,\u201d Theory of Cryptography, TCC 2009, Lecture Notes in Computer Science, vol.5444, pp.457-473, 2009. 10.1007\/978-3-642-00457-5_27","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] A.C.-C. Yao, \u201cHow to generate and exchange secrets,\u201d Proc. 27th FOCS, pp.162-167, 1986. 10.1109\/sfcs.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] E. Zavattoni, L.J.D. Perez, S. Mitsunari, A. S\u00e1nchez-Ram\u00edrez, T. Teruya, and F. Rodr\u00edguez-Henr\u00edquez, \u201cSoftware implementation of an attribute-based encryption scheme,\u201d IEEE Trans. Comput., vol.64, no.5, pp.1429-1441, 2015. 10.1109\/tc.2014.2329681","DOI":"10.1109\/TC.2014.2329681"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/10\/E100.D_2016INP0011\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T23:37:05Z","timestamp":1750894625000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/10\/E100.D_2016INP0011\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":20,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016inp0011","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}