{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:40:45Z","timestamp":1743151245652,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":6,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819709441"},{"type":"electronic","value":"9789819709458"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0945-8_28","type":"book-chapter","created":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T20:02:14Z","timestamp":1708804934000},"page":"411-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Autonomous Path Proxy Re-encryption Without Pairing for\u00a0Cloud-Assisted mHealth"],"prefix":"10.1007","author":[{"given":"Linghui","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiguo","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carvajal Roca Ivan","family":"Edmar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,25]]},"reference":[{"issue":"2","key":"28_CR1","first-page":"1","volume":"11","author":"A Paul","year":"2021","unstructured":"Paul, A., Selvi, S.S.D., Rangan, C.P.: A provably secure conditional proxy re-encryption scheme without pairing. J. Int. Serv. Inf. Secur. 11(2), 1\u201321 (2021)","journal-title":"J. Int. Serv. Inf. Secur."},{"issue":"10","key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-022-3612-6","volume":"66","author":"W Xie","year":"2023","unstructured":"Xie, W., Weng, J., Tong, Y., Liang, X., Yao, L., Zhao, F.: Lattice-based autonomous path proxy re-encryption in the standard model. Sci. China Inf. Sci. 66(10), 202101 (2023)","journal-title":"Sci. China Inf. Sci."},{"issue":"5","key":"28_CR3","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TDSC.2017.2714166","volume":"16","author":"Z Cao","year":"2017","unstructured":"Cao, Z., Wang, H., Zhao, Y.: AP-PRE: autonomous path proxy re-encryption and its applications. IEEE Trans. Dependable Secur. Comput. 16(5), 833\u2013842 (2017)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"87322","DOI":"10.1109\/ACCESS.2022.3200084","volume":"10","author":"H Hu","year":"2022","unstructured":"Hu, H., Cao, Z., Dong, X.: Autonomous path identity-based broadcast proxy re-encryption for data sharing in clouds. IEEE Access 10, 87322\u201387332 (2022)","journal-title":"IEEE Access"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-00468-1_20","volume-title":"Public Key Cryptography","author":"J Shao","year":"2009","unstructured":"Shao, J., Cao, Z.: CCA-secure proxy re-encryption without pairings. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 357\u2013376. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_20"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.future.2015.11.012","volume":"62","author":"Y Lu","year":"2016","unstructured":"Lu, Y., Li, J.: A pairing-free certificate-based proxy re-encryption scheme for secure data sharing in public clouds. Future Gener. Comput. Syst. 62, 140\u2013147 (2016)","journal-title":"Future Gener. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0945-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T17:30:37Z","timestamp":1741368637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0945-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819709441","9789819709458"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0945-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2023.github.io\/#","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"152","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}