{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:46:50Z","timestamp":1725907610419},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319584232"},{"type":"electronic","value":"9783319584249"}],"license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-58424-9_13","type":"book-chapter","created":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T07:33:44Z","timestamp":1502523224000},"page":"221-236","source":"Crossref","is-referenced-by-count":1,"title":["Searching Encrypted Data on the Cloud"],"prefix":"10.1007","author":[{"given":"Khaled A.","family":"Al-Utaibi","sequence":"first","affiliation":[]},{"given":"El-Sayed M.","family":"El-Alfy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. H. Bloom","year":"1970","unstructured":"Bloom, B. H. (1970). Space\/time trade-offs in hash coding with allowable errors. ACM Communications, 13, 422\u2013426.","journal-title":"ACM Communications"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Boneh, D., Di\u00a0Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004). Public key encryption with keyword search. In EUROCRYPT 2004. Lecture notes in computer science (Vol.\u00a03027, pp.\u00a0506\u2013522).","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., & Waters, B. (2007). Conjunctive, subset, and range queries on encrypted data. In Theory of Cryptography Conference (pp.\u00a0535\u2013554).","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"13_CR4","unstructured":"B\u00f6sch, C., Hartel, P., Jonker, W., & Peter, A. (2014). A survey of provably secure searchable encryption. ACM Computing Surveys, 47(2), 18:1\u201318:51."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., & Kindarji, B. (2009). Error-tolerant searchable encryption. In\u00a0Proceedings of IEEE International Conference on Communications (ICC\u201909) (pp.\u00a0768\u2013773).","DOI":"10.1109\/ICC.2009.5199004"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006). Searchable symmetric encryption: Improved definitions and efficient constructions. In Proceedings of 13th ACM Conference on Computer and Communications Security, CCS \u201906 (pp.\u00a079\u201388).","DOI":"10.1145\/1180405.1180417"},{"issue":"5","key":"13_CR7","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R. Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011). Searchable symmetric encryption: Improved definitions and efficient constructions. Journal of Computer Security, 19(5), 895\u2013934.","journal-title":"Journal of Computer Security"},{"issue":"3","key":"13_CR8","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"Fredman, M. L., Koml\u00f3s, J., & Szemer\u00e9di, E. (1984). Storing a sparse table with 0(1) worst case access time. Journal of the ACM, 31(3), 538\u2013544.","journal-title":"Journal of the ACM"},{"key":"13_CR9","unstructured":"Goh, E. J. (2003). Secure indexes. Cryptology ePrint Archive, Report 2003\/216."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Golle, P., Staddon, J., & Waters, B. (2004) Secure conjunctive keyword search over encrypted data. In Applied cryptography and network security. Lecture notes in computer science (Vol.\u00a03089, pp.\u00a031\u201345). Berlin: Springer.","DOI":"10.1007\/978-3-540-24852-1_3"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.future.2016.01.007","volume":"62","author":"F. Han","year":"2016","unstructured":"Han, F., Qin, J., & Hu, J. (2016). Secure searches in the cloud: A survey. Future Generation Computer Systems, 62, 66\u201375.","journal-title":"Future Generation Computer Systems"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W. (2010). Fuzzy keyword search over encrypted data in cloud computing. In Proceedings of\u00a029th Conference on Information Communications (INFOCOM\u201910) (pp.\u00a0441\u2013445).","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"13_CR13","unstructured":"Park, D. J., Kim, K., & Lee, P. J. (2004). Public key encryption with conjunctive field keyword search. In International Workshop on Information Security Applications (pp.\u00a073\u201386)."},{"key":"13_CR14","unstructured":"Song, D., Wanger, D., & Perrig, A. (2000). Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy (pp.\u00a044\u201355)."},{"key":"13_CR15","unstructured":"Xiao, S., Ge, A., Zhang, J., Ma, C., & Wang, X. (2016). Asymmetric searchable encryption from inner product encryption. In International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (pp.\u00a0123\u2013132)."},{"issue":"1","key":"13_CR16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.jnca.2010.07.007","volume":"34","author":"B. Zhang","year":"2011","unstructured":"Zhang, B., & Zhang, F. (2011). An efficient public key encryption with conjunctive-subset keywords search. Journal of Network and Computer Applications, 34(1), 262\u2013267.","journal-title":"Journal of Network and Computer Applications"}],"container-title":["Computer and Network Security Essentials"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58424-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T07:39:26Z","timestamp":1502523566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58424-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"ISBN":["9783319584232","9783319584249"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58424-9_13","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]}}}