{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T06:05:22Z","timestamp":1670133922581},"reference-count":30,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,12,1]]},"DOI":"10.1587\/transfun.2021eap1122","type":"journal-article","created":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T22:09:53Z","timestamp":1654639793000},"page":"1578-1590","source":"Crossref","is-referenced-by-count":0,"title":["Substring Searchable Symmetric Encryption Based on an Improved DAWG"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Hiroaki","family":"YAMAMOTO","sequence":"first","affiliation":[{"name":"Faculty of Engineering, Shinshu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryosuke","family":"ODA","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Shinshu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihiro","family":"WACHI","sequence":"additional","affiliation":[{"name":"NTT COMWARE CORPORATION"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"FUJIWARA","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Shinshu University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] A. Blumer, J. Blumer, and D. Haussler, \u201cThe smallest automaton recognizing the subwords of a text,\u201d Theoret. Comput. Sci., vol.40, pp.31-55, 1985. 10.1016\/0304-3975(85)90157-4","DOI":"10.1016\/0304-3975(85)90157-4"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] A. Blumer, J. Blumer, D. Haussler, and R. Mcconnell, \u201cComplete inverted files for efficient text retrieval and analysis,\u201d J. ACM, vol.34, no.3, pp.578-595, 1987. 10.1145\/28869.28873","DOI":"10.1145\/28869.28873"},{"key":"3","unstructured":"[3] R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval (Section 8), ACM Press, Addison-Wesley, 1999."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] R. Bost, B. Minaud, and O. Ohrimenko, \u201cForward and backward private searchable encryption from constrained cryptographic primitives,\u201d Proc. CCS2017, pp.1465-1482, 2017. 10.1145\/3133956.3133980","DOI":"10.1145\/3133956.3133980"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner, \u201cHighly-scalable searchable symmetric encryption with support for Boolean queries,\u201d Proc. CRYPTO 2013, Part I. LNCS 8042, pp.353-373, 2013. 10.1007\/978-3-642-40041-4_20","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, \u201cSearchable symmetric encryption: Improved definitions and efficient constructions,\u201d J. Computer Security, vol.19, no.5, pp.895-934, 2011. 10.3233\/jcs-2011-0426","DOI":"10.3233\/JCS-2011-0426"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] M. Chase and E. Shen, \u201cSubstring-searchable symmetric encryption,\u201d Proc. Privacy Enhancing Technologies 2015, vol.2015, no.2, pp.263-281, 2015. 10.1515\/popets-2015-0014","DOI":"10.1515\/popets-2015-0014"},{"key":"8","unstructured":"[8] J.G. Chamani, D. Papadopoulos, C. Papamanthou, and R. Jalili, \u201cNew constructions for forward and backward private symmetric searchable encryption,\u201d Proc. CCS2018, pp.1038-1055, 2018. 10.1145\/3243734.3243833"},{"key":"9","unstructured":"[9] Cohen W.W.: Enron Email Dataset. http:\/\/www.cs.cmu.edu\/~enron\/"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] S. Faber, S. Jarecki, H. Krawczyk, Q. Nguyen, M. Rosu, and M. Steiner, \u201cRich queries on encrypted data: Beyond exact matches,\u201d Proc. ESORICS 2015, LNCS 9327, pp.123-145, 2015. 10.1007\/978-3-319-24177-7_7","DOI":"10.1007\/978-3-319-24177-7_7"},{"key":"11","unstructured":"[11] E.-J. Goh, \u201cSecure Indexes,\u201d Stanford Univ. Technical Report, In IACR ePrint Cryptography Archive, 2003, See http:\/\/eprint.iacr.org\/2003\/216"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] H. Hac\u00fcigum\u00fcs, B. Hore, B. Iyer, and S. Mehrotra, \u201cSearch on Encrypted Data,\u201d Advances in Information Security, vol.33, pp.383-425, 2007. 10.1007\/978-0-387-27696-0_12","DOI":"10.1007\/978-0-387-27696-0_12"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] F. Hahn and F. Kerschbaum, \u201cSearchable encryption with secure and efficient updates,\u201d Proc. CCS2014, pp.310-320, 2014. 10.1145\/2660267.2660297","DOI":"10.1145\/2660267.2660297"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] F. Hahn, N. Loza, and F. Kerschbaum, \u201cPractical and secure substring search,\u201d Proc. SIGMOD\/PODS'18, pp.163-176, 2018. 10.1145\/3183713.3183754","DOI":"10.1145\/3183713.3183754"},{"key":"15","unstructured":"[15] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory Language and Computation, Addison Wesley, Reading Mass, 1979."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J. Katz and Y. Lindell, Introduction to Modern Cryptography, 2nd ed., CRC Press, 2015. 10.1201\/b17668","DOI":"10.1201\/b17668"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] K. Kurosawa and Y. Ohtaki, \u201cUC-secure searchable symmetric encryption,\u201d Proc. FC 2012, LNCS 7397, pp.285-298, 2012. 10.1007\/978-3-642-32946-3_21","DOI":"10.1007\/978-3-642-32946-3_21"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] S. Kamara, C. Papamanthou, and T. Roeder, \u201cDynamic searchable symmetric encryption,\u201d Proc. CCS2012, pp.965-976, 2012. 10.1145\/2382196.2382298","DOI":"10.1145\/2382196.2382298"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] I. Leontiadis and M. Li, \u201cStorage efficient substring searchable symmetric encryption,\u201d Proc. 6th International Workshop on Security in Cloud Computing (SCC'18), pp.3-14, 2018. 10.1145\/3201595.3201598","DOI":"10.1145\/3201595.3201598"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, \u201cFuzzy keyword search over encrypted data in cloud computing,\u201d Proc. INFCOM 2010, pp.441-445, 2010. 10.1109\/infcom.2010.5462196","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] N. Mainardi, A. Barenghi, and G. Pelosi, \u201cPrivacy preserving substring search protocol with polylogarithmic communication cost,\u201d Proc. ACSAC 2019, pp.297-312, 2019. 10.1145\/3359789.3359842","DOI":"10.1145\/3359789.3359842"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] R. Miyoshi, H. Yamamoto, H. Fujiwara, and T. Miyazaki, \u201cPractical and secure searchable symmetric encryption with a small index,\u201d Proc. NordSec 2017, LNCS 10674, pp.53-69, 2017. 10.1007\/978-3-319-70290-2_4","DOI":"10.1007\/978-3-319-70290-2_4"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] M. Mohri, P. Moreno, and E. Weinstein, \u201cGeneral suffix automaton construction algorithm and space bounds,\u201d Theor. Comput. Sci., vol.410, no.37, pp.3553-3562, 2009. 10.1016\/j.tcs.2009.03.034","DOI":"10.1016\/j.tcs.2009.03.034"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] R.A. Popa, C.M.S. Redfield, N. Zeldovich, and H. Balakrishnan, \u201cCryptDB: Processing queries on an encrypted database,\u201d Commun. ACM, vol.55, no.9, pp.103-111, 2012. 10.1145\/2330667.2330691","DOI":"10.1145\/2330667.2330691"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] T. Suga, T. Nishida, and K. Sakurai, \u201cSecure keyword search using bloom filter with specified character positions,\u201d Proc. ProvSec 2012, LNCS 7496, pp.235-252, 2012. 10.1007\/978-3-642-33272-2_15","DOI":"10.1007\/978-3-642-33272-2_15"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] M. Strizhov and I. Ray, \u201cSubstring position search over encrypted cloud data using tree-based index,\u201d Proc. IEEE IC2E 2015, pp.165-174, 2015. 10.1109\/ic2e.2015.33","DOI":"10.1109\/IC2E.2015.33"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] M. Strizhov, Z. Osman, and I. Ray, \u201cSubstring position search over encrypted cloud data supporting efficient multi-user setup,\u201d Future Internet, vol.8, no.4, 28, 2016. 10.3390\/fi8030028","DOI":"10.3390\/fi8030028"},{"key":"28","unstructured":"[28] D.X. Song, D. Wagner, and A. Perrig, \u201cTechniques for searchers on encrypted data,\u201d IEEE Symposium on Security and Privacy, pp.44-55, 2000. 10.1109\/secpri.2000.848445"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] H. Yamamoto, \u201cSecure substring search scheme on encrypted data,\u201d Proc. IWSEC 2016, LNCS 9836, pp.111-131, 2016. 10.1007\/978-3-319-44524-3_7","DOI":"10.1007\/978-3-319-44524-3_7"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] H. Yamamoto, Y. Wachi, and H. Fujiwara \u201cSpace-efficient and secure substring searchable symmetric encryption using an improved DAWG,\u201d Proc. ProvSec 2019, LNCS 11821, pp.130-148, 2019. 10.1007\/978-3-030-31919-9_8","DOI":"10.1007\/978-3-030-31919-9_8"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/12\/E105.A_2021EAP1122\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T03:16:24Z","timestamp":1670037384000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/12\/E105.A_2021EAP1122\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":30,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021eap1122","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,1]]},"article-number":"2021EAP1122"}}