{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:25:27Z","timestamp":1722943527022},"reference-count":36,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcm"],"published-print":{"date-parts":[[2015]]},"DOI":"10.12720\/jcm.10.10.766-772","type":"journal-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T03:36:08Z","timestamp":1452569768000},"source":"Crossref","is-referenced-by-count":2,"title":["The Research and Outlook for Keyword-Based Searchable Encryption in Cloud Storage"],"prefix":"10.12720","author":[{"name":"Jilin University, Changchun, 130012, China","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tengfei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongtu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongying","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4977","published-online":{"date-parts":[[2015]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.12.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14992-4_13"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ncis.2011.64"},{"issue":"no. 4","key":"ref4","first-page":"880","article-title":"Survey on the research and development of searchable encryption schemes","volume":"25","author":"Shen","year":"2014","unstructured":"[5] Z. R. Shen, W. Xue, and J. W. Shu, \"Survey on the research and development of searchable encryption schemes,\" Journal of Software, vol. 25, no. 4, pp. 880-895, January 2014.","journal-title":"J Softw","ISSN":"http:\/\/id.crossref.org\/issn\/1000-9825","issn-type":"print"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/153791"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_9"},{"key":"ref8","article-title":"On the computational practicality of private information retrieval","volume-title":"Proc Networks and Distributed Systems Security Symposium Stony Brook Network","author":"Sion","year":"2007","unstructured":"[9] R. Sion and B. Carbunar, \"On the computational practicality of private information retrieval,\" in Proc. Networks and Distributed Systems Security Symposium Stony Brook Network, San Diego, 2007."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2006.25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-87126-9_2"},{"key":"ref12","first-page":"44","article-title":"Practical techniques for searches on encrypted data","volume-title":"Proc IEEE Symposium on Security and Privacy","author":"Song","year":"2000","unstructured":"[13] D. Song, D. Wagner, and A. Perrig, \"Practical techniques for searches on encrypted data,\" in Proc. IEEE Symposium on Security and Privacy, Berkeley, 2000, pp. 44-55."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2011-0426"},{"key":"ref14","article-title":"Building an encrypted and searchable audit log","volume-title":"Proc 11th Annual Network and Distributed System Security Symp","author":"Waters","year":"2004","unstructured":"[16] B. Waters, D. Balfanz, G. Durfee, and D. Smetters, \"Building an encrypted and searchable audit log,\" in Proc. 11th Annual Network and Distributed System Security Symp, San Diego, 2004."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11602897_35"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/infcom.2010.5462196"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.45"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/icdcs.2011.84"},{"issue":"no. 16","key":"ref19","first-page":"506","article-title":"Public key encryption with keyword search","volume":"49","author":"Boneh","year":"2003","unstructured":"[21] D. Boneh, G. Crescenzo, R. Ostrovsky, and G. Persiano, \"Public key encryption with keyword search,\" Lecture Notes in Computer Science, vol.49, no. 16, pp. 506-522, 2003.","journal-title":"Lect Notes Comput Sci","ISSN":"http:\/\/id.crossref.org\/issn\/0302-9743","issn-type":"print"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2011.03.010"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24852-1_3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73489-5_2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79104-1_6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/icdcs.2011.55"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_13"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"ref28","first-page":"44","article-title":"Converting pairing-based cryptosystems from composite-order groups to prime-order groups","volume-title":"Proc 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Reeman","year":"2010","unstructured":"[30] D. Reeman, \"Converting pairing-based cryptosystems from composite-order groups to prime-order groups,\" in Proc. 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, 2010, pp. 44-61."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_13"},{"key":"ref31","first-page":"466","volume-title":"\"Towards hierarchical identity-based encryption \" in Proc","author":"Horwitz","year":"2002","unstructured":"[33] J. Horwitz and B. Lynn, \"Towards hierarchical identity-based encryption,\" in Proc. Advances in Cryptology-EUROCRYPT, 2002, pp. 466-481."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180418"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/sp.2007.11"},{"key":"ref35","first-page":"75","volume-title":"\"Off-line keyword guessing attacks on recent keyword search schemes over encrypted data \" in Secure Data Management","author":"Byun","year":"2006","unstructured":"[37] J. W. Byun, H. S. Rhee, H. A. Park, and D. H. Lee, \"Off-line keyword guessing attacks on recent keyword search schemes over encrypted data,\" in Secure Data Management, W. Jonker and M. Petkovic, Eds., Berlin Heidelberg: Springer-Verlag, 2006, pp. 75-83."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2298\/CSIS121104028W"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2015\/1009\/20151009114809568.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:50:48Z","timestamp":1486169448000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=152&id=871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":36,"URL":"https:\/\/doi.org\/10.12720\/jcm.10.10.766-772","relation":{},"ISSN":["1796-2021"],"issn-type":[{"type":"print","value":"1796-2021"}],"subject":[],"published":{"date-parts":[[2015]]}}}