{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:22:04Z","timestamp":1742984524080,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030129415"},{"type":"electronic","value":"9783030129422"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-12942-2_8","type":"book-chapter","created":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T08:26:50Z","timestamp":1549355210000},"page":"85-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Searchable Encryption Scheme for Cloud Computing"],"prefix":"10.1007","author":[{"given":"Stefania Loredana","family":"Nita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius Iulian","family":"Mihailescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"key":"8_CR1","unstructured":"10 Key marketing trends for 2017 and ideas for exceeding customer expectations. IBM Marketing Cloud (2017)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Mell, P., Grance, T.: The NIST definition of cloud computing (2011)","DOI":"10.6028\/NIST.SP.800-145"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chang, V., Bacigalupo, D., Wills, G., De Roure, D.: A categorisation of cloud computing business models. In: Proceedings of the 2010 10th IEEE\/ACM International Conference on Cluster, Cloud and Grid Computing, pp. 509\u2013512. IEEE Computer Society (2010)","DOI":"10.1109\/CCGRID.2010.132"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ins.2015.01.025","volume":"305","author":"M Ali","year":"2015","unstructured":"Ali, M., Khan, S.U., Vasilakos, A.V.: Security in cloud computing: opportunities and challenges. Inf. Sci. 305, 357\u2013383 (2015)","journal-title":"Inf. Sci."},{"key":"8_CR5","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 \u201999","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). \n                    https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"T Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308\u2013318. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/BFb0054135"},{"issue":"5","key":"8_CR7","doi-asserted-by":"publisher","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.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF03391580","volume":"1","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Wang, J., Chen, X.: Secure searchable encryption: a survey. J. Commun. Inf. Netw. 1(4), 52\u201365 (2016)","journal-title":"J. Commun. Inf. Netw."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 1973 IEEE Conference Record of 14th Annual Symposium on Switching and Automata Theory, SWAT 2008, pp. 1\u201311. IEEE (1973)","DOI":"10.1109\/SWAT.1973.13"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM (JACM) 23(2), 262\u2013272 (1976)","journal-title":"J. ACM (JACM)"},{"key":"8_CR11","unstructured":"Ukkonen, E.: Constructing suffix trees on-line in linear time. In: Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture-Information Processing 1992, pp. 484\u2013492. North-Holland Publishing Co. (1992)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11780441_7","volume-title":"Combinatorial Pattern Matching","author":"S Inenaga","year":"2006","unstructured":"Inenaga, S., Takeda, M.: On-line linear-time construction of word suffix trees. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 60\u201371. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11780441_7"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","volume":"21","author":"M Abdalla","year":"2008","unstructured":"Abdalla, M., et al.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J. Cryptol. 21(3), 350\u2013391 (2008)","journal-title":"J. Cryptol."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-77026-8_21","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"G Crescenzo Di","year":"2007","unstructured":"Di Crescenzo, G., Saraswat, V.: Public key encryption with searchable keywords based on Jacobi symbols. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 282\u2013296. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-77026-8_21"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/978-3-540-69839-5_96","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"J Baek","year":"2008","unstructured":"Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with keyword search revisited. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008. LNCS, vol. 5072, pp. 1249\u20131259. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-69839-5_96"},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.jss.2009.11.726","volume":"83","author":"HS Rhee","year":"2010","unstructured":"Rhee, H.S., Park, J.H., Susilo, W., Lee, D.H.: Trapdoor security in a searchable public-key encryption scheme with a designated tester. J. Syst. Softw. 83(5), 763\u2013771 (2010)","journal-title":"J. Syst. Softw."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535\u2013554. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-70936-7_29"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.ins.2018.04.012","volume":"453","author":"S Ma","year":"2018","unstructured":"Ma, S., Mu, Y., Susilo, W., Yang, B.: Witness-based searchable encryption. Inf. Sci. 453, 364\u2013378 (2018)","journal-title":"Inf. Sci."},{"key":"8_CR20","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-981-10-5903-2_68","volume-title":"Intelligent Communication, Control and Devices","author":"SK Mahreen","year":"2018","unstructured":"Mahreen, S.K., Warsi, M.R., Neelam, S.K.: Domain dictionary-based metadata construction for search over encrypted cloud data. In: Singh, R., Choudhury, S., Gehlot, A. (eds.) Intelligent Communication, Control and Devices. AISC, vol. 624, pp. 661\u2013669. Springer, Singapore (2018). \n                    https:\/\/doi.org\/10.1007\/978-981-10-5903-2_68"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1515\/popets-2018-0002","volume":"2018","author":"Mohammad Etemad","year":"2018","unstructured":"Etemad, M., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Evans, D.: Efficient dynamic searchable encryption with forward privacy. In: Proceedings on Privacy Enhancing Technologies, vol. 2018, no. 1, pp. 5\u201320 (2018)","journal-title":"Proceedings on Privacy Enhancing Technologies"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12942-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:41:14Z","timestamp":1558478474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12942-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030129415","9783030129422"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12942-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SECITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security for Information Technology and Communications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.secitc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Three papers of invited keynote speakers are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}