{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T01:33:56Z","timestamp":1768527236537,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030050627","type":"print"},{"value":"9783030050634","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-05063-4_23","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T19:23:45Z","timestamp":1544124225000},"page":"288-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Keyword Searchable Encryption with Fine-Grained Forward Secrecy for Internet of Thing Data"],"prefix":"10.1007","author":[{"given":"Rang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Xiaosong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaofen","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guowu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wanpeng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"23_CR1","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, pp. 44\u201355. IEEE Computer Society Press, May 2000"},{"key":"23_CR2","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). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"23_CR3","unstructured":"PBC library. https:\/\/crypto.stanford.edu\/pbc\/"},{"key":"23_CR4","first-page":"1","volume":"99","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Liu, X., Deng, R.H., Li, Y.: Lightweight sharable and traceable secure mobile health system. IEEE Trans. Dependable Secur. Comput. 99, 1\u20131 (2017)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"23_CR5","unstructured":"Popa, R.A., Zeldovich, N.: Multi-key searchable encryption, Cryptology ePrint Archive, Report 2013\/508 (2013)"},{"key":"23_CR6","unstructured":"Popa, R.A., Stark, E., Valdez, S., Helfer, J., Zeldovich, N., Balakrishnan, H.: Building web applications on top of encrypted data using Mylar. In: Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2014, pp. 157-172 (2014)"},{"issue":"11","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1943","DOI":"10.1109\/TIFS.2014.2359389","volume":"9","author":"Q Tang","year":"2014","unstructured":"Tang, Q.: Nothing is for free: security in searching shared and encrypted data. IEEE Trans. Inf. Forensics Secur. 9(11), 1943\u20131952 (2014)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-08344-5_8","volume-title":"Information Security and Privacy","author":"Z Liu","year":"2014","unstructured":"Liu, Z., Li, J., Chen, X., Yang, J., Jia, C.: TMDS: thin-model data sharing scheme supporting keyword search in cloud storage. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol. 8544, pp. 115\u2013130. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08344-5_8"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-23318-5_17","volume-title":"Information Security","author":"C Rompay Van","year":"2015","unstructured":"Van Rompay, C., Molva, R., \u00d6nen, M.: Multi-user searchable encryption in the cloud. In: Lopez, J., Mitchell, C.J. (eds.) ISC 2015. LNCS, vol. 9290, pp. 299\u2013316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23318-5_17"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TPDS.2013.112","volume":"25","author":"C-K Chu","year":"2014","unstructured":"Chu, C.-K., Chow, S.S.M., Tzeng, W.-G., Zhou, J., Deng, R.H.: Key-aggregate cryptosystem for scalable data sharing in cloud storage. IEEE Trans. Parallel Distrib. Syst. 25(2), 468\u2013477 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"23_CR11","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TC.2015.2389959","volume":"65","author":"B Cui","year":"2016","unstructured":"Cui, B., Liu, Z., Wang, L.: Key-aggregate searchable encryption for group data sharing via cloud storage. IEEE Trans. Comput. 65(8), 2374\u20132385 (2016)","journal-title":"IEEE Trans. Comput."},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-45744-4_9","volume-title":"Computer Security \u2013 ESORICS 2016","author":"A Kiayias","year":"2016","unstructured":"Kiayias, A., Oksuz, O., Russell, A., Tang, Q., Wang, B.: Efficient encrypted keyword search for multi-user data sharing. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 173\u2013195. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45744-4_9"},{"issue":"8","key":"23_CR13","doi-asserted-by":"publisher","first-page":"3648","DOI":"10.1109\/TII.2018.2794442","volume":"14","author":"R Zhou","year":"2018","unstructured":"Zhou, R., Zhang, X., Du, X., Wang, X., Yang, G., Mohsen, G.: File-centric multi-key aggregate keyword searchable encryption for industrial internet of things. IEEE Trans. Ind. Inform. 14(8), 3648\u20133658 (2018)","journal-title":"IEEE Trans. Ind. Inform."},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-40367-0_10","volume-title":"Information Security and Privacy","author":"T Li","year":"2016","unstructured":"Li, T., Liu, Z., Li, P., Jia, C., Jiang, Z.L., Li, J.: Verifiable searchable encryption with aggregate keys for data sharing in outsourcing storage. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 153\u2013169. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40367-0_10"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.future.2017.02.024","volume":"78","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Li, T., Li, P., Jia, C., Li, J.: Verifiable searchable encryption with aggregate keys for data sharing system. Future Gener. Comput. Syst. 78, 778\u2013788 (2018)","journal-title":"Future Gener. Comput. Syst."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-11203-9_24","volume-title":"Computer Security - ESORICS 2014","author":"J Shi","year":"2014","unstructured":"Shi, J., Lai, J., Li, Y., Deng, R.H., Weng, J.: Authorized keyword search on encrypted data. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8712, pp. 419\u2013435. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11203-9_24"},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1109\/TPDS.2014.2355202","volume":"27","author":"W Sun","year":"2016","unstructured":"Sun, W., Yu, S., Lou, W., Hou, Y.T.: Protecting your right: verifiable attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. IEEE Trans. Parallel Distrib. Syst. 27(4), 1187\u20131198 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Zheng, Q., Shouhuai, X., Ateniese, G.: VABKS: verifiable attribute-based keyword search over outsourced encrypted data. In: 2014 Proceedings IEEE, INFOCOM, pp. 522\u2013530 (2014)","DOI":"10.1109\/INFOCOM.2014.6847976"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-79104-1_6","volume-title":"Information Security Practice and Experience","author":"F Bao","year":"2008","unstructured":"Bao, F., Deng, R.H., Ding, X., Yang, Y.: Private query on encrypted data in multi-user settings. In: Chen, L., Mu, Y., Susilo, W. (eds.) ISPEC 2008. LNCS, vol. 4991, pp. 71\u201385. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79104-1_6"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-70567-3_10","volume-title":"Data and Applications Security XXII","author":"C Dong","year":"2008","unstructured":"Dong, C., Russello, G., Dulay, N.: Shared and searchable encrypted data for untrusted servers. In: Atluri, V. (ed.) DBSec 2008. LNCS, vol. 5094, pp. 127\u2013143. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70567-3_10"},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"367","DOI":"10.3233\/JCS-2010-0415","volume":"19","author":"C Dong","year":"2011","unstructured":"Dong, C., Russello, G., Dulay, N.: Shared and searchable encrypted data for untrusted servers. J. Comput. Secur. 19(3), 367\u2013397 (2011)","journal-title":"J. Comput. Secur."},{"issue":"5","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s11390-016-1676-9","volume":"31","author":"X Wang","year":"2016","unstructured":"Wang, X., Mu, Y., Chen, R., Zhang, X.: Secure channel free ID-based searchable encryption for peer-to-peer group. J. Comput. Sci. Technol. 31(5), 1012\u20131027 (2016)","journal-title":"J. Comput. Sci. Technol."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05063-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T18:18:02Z","timestamp":1573064282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05063-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050627","9783030050634"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05063-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}