{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:07:57Z","timestamp":1743113277113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031265525"},{"type":"electronic","value":"9783031265532"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26553-2_4","type":"book-chapter","created":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T11:33:31Z","timestamp":1676806411000},"page":"67-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["You Can Sign but Not Decrypt: Hierarchical Integrated Encryption and Signature"],"prefix":"10.1007","author":[{"given":"Min","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Binbin","family":"Tu","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,19]]},"reference":[{"key":"4_CR1","unstructured":"Government of Canada. https:\/\/www.canada.ca\/en\/shared-services\/corporate\/transparency\/briefing-documents\/ministerial-briefing-book\/delegation.html"},{"key":"4_CR2","unstructured":"PGP. https:\/\/www.openpgp.org"},{"key":"4_CR3","unstructured":"The University of Iowa. https:\/\/opsmanual.uiowa.edu\/administrative-financial-and-facilities-policies\/facsimile-signatures-and-signature-assignment-2"},{"key":"4_CR4","unstructured":"Viafirma. https:\/\/www.viafirma.com\/blog-xnoccio\/en\/signature-delegation\/"},{"key":"4_CR5","unstructured":"WhatsApp. https:\/\/www.whatsapp.com"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Akinyele, J.A., Garman, C., Hohenberger, S.: Automating fast and secure translations from type-i to type-iii pairing schemes. In: ACM CCS 2015, pp. 1370\u20131381 (2015)","DOI":"10.1145\/2810103.2813601"},{"key":"4_CR7","unstructured":"Alimi, P.: On the use of pedersen commitments for confidential payments. https:\/\/research.nccgroup.com\/2021\/06\/15\/on-the-use-of-pedersen-commitments-for-confidential-payments\/"},{"key":"4_CR8","unstructured":"Boldyreva, A.: Secure proxy signature scheme for delegation of signing rights (2003). http:\/\/eprint.iacr.org\/2003\/096\/"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Efficient selective-id secure identity based encryption without random oracles. Cryptology ePrint Archive, Report 2004\/172 (2004). https:\/\/ia.cr\/2004\/172","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-030-51280-4_23","volume-title":"Financial Cryptography and Data Security","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Agrawal, S., Zamani, M., Boneh, D.: Zether: towards privacy in a smart contract world. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 423\u2013443. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_23"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255\u2013271. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_16"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.compeleceng.2008.05.005","volume":"35","author":"F Cao","year":"2009","unstructured":"Cao, F., Cao, Z.: A secure identity-based multi-proxy signature scheme. Comput. Electr. Eng. 35(1), 86\u201395 (2009)","journal-title":"Comput. Electr. Eng."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Chen, Y., Ma, X., Tang, C., Au, M.H.: PGC: pretty good confidential transaction system with auditability. In: ESORICS 2020, pp. 591\u2013610 (2020)","DOI":"10.1007\/978-3-030-58951-6_29"},{"key":"4_CR14","unstructured":"Chen, Y., Tang, Q., Wang, Y.: Hierarchical integrated signature and encryption. Cryptology ePrint Archive, Report 2021\/1237 (2021). https:\/\/ia.cr\/2021\/1237"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-45708-9_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J-S Coron","year":"2002","unstructured":"Coron, J.-S., Joye, M., Naccache, D., Paillier, P.: Universal padding schemes for RSA. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 226\u2013241. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_15"},{"key":"4_CR16","unstructured":"Dai, J.Z., Yang, X.H., Dong, J.X.: Designated-receiver proxy signature scheme for electronic commerce. In: SMC 2003 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483) (2003)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"16","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discret. Appl. Math. 16, 3113\u20133121 (2008)","journal-title":"Discret. Appl. Math."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"C Gentry","year":"2002","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548\u2013566. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_34"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Haber, S., Pinkas, B.: Securely combining public-key cryptosystems. In: ACM CCS 2001, pp. 215\u2013224 (2001)","DOI":"10.1145\/501983.502013"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-46035-7_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"J Horwitz","year":"2002","unstructured":"Horwitz, J., Lynn, B.: Toward hierarchical identity-based encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 466\u2013481. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_31"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11596042_50","volume-title":"Embedded and Ubiquitous Computing \u2013 EUC 2005 Workshops","author":"X Huang","year":"2005","unstructured":"Huang, X., Mu, Y., Susilo, W., Zhang, F., Chen, X.: A short proxy signature scheme: efficient authentication in the ubiquitous world. In: Enokido, T., Yan, L., Xiao, B., Kim, D., Dai, Y., Yang, L.T. (eds.) EUC 2005. LNCS, vol. 3823, pp. 480\u2013489. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11596042_50"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/11943952_40","volume-title":"Mobile Ad-hoc and Sensor Networks","author":"X Huang","year":"2006","unstructured":"Huang, X., Susilo, W., Mu, Y., Wu, W.: Proxy signature without random oracles. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds.) MSN 2006. LNCS, vol. 4325, pp. 473\u2013484. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11943952_40"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BFb0028478","volume-title":"Information and Communications Security","author":"S Kim","year":"1997","unstructured":"Kim, S., Park, S., Won, D.: Proxy signatures, revisited. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 223\u2013232. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028478"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-45146-4_22","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Komano","year":"2003","unstructured":"Komano, Y., Ohta, K.: Efficient universal padding techniques for multiplicative trapdoor one-way permutation. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 366\u2013382. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_22"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/3-540-47719-5_37","volume-title":"Information Security and Privacy","author":"B Lee","year":"2001","unstructured":"Lee, B., Kim, H., Kim, K.: Secure mobile agent using strong non-designated proxy signature. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 474\u2013486. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47719-5_37"},{"issue":"9","key":"4_CR27","first-page":"1338","volume":"79","author":"M Mambo","year":"1996","unstructured":"Mambo, M., Usuda, K., Okamoto, E.: Proxy signatures: delegation of the power to sign messages. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 79(9), 1338\u20131354 (1996)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Mambo, M., Usuda, K., Okamoto, E.: Proxy signatures for delegating signing operation. In: Proceedings of the 3rd ACM Conference on Computer and Communications Security, pp. 48\u201357. CCS 1996, Association for Computing Machinery, New York, NY, USA (1996)","DOI":"10.1145\/238168.238185"},{"key":"4_CR29","unstructured":"Neuman, B.: Proxy-based authorization and accounting for distributed systems. In: 1993 Proceedings. The 13th International Conference on Distributed Computing Systems, pp. 283\u2013291 (1993)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-25385-0_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"KG Paterson","year":"2011","unstructured":"Paterson, K.G., Schuldt, J.C.N., Stam, M., Thomson, S.: On the joint security of encryption and signature, revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 161\u2013178. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_9"},{"issue":"5","key":"4_CR31","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1137\/060676155","volume":"37","author":"K Rubin","year":"2008","unstructured":"Rubin, K., Silverberg, A.: Compression in finite fields and torus-based cryptography. SIAM J. Comput. 37(5), 1401\u20131428 (2008)","journal-title":"SIAM J. Comput."},{"key":"4_CR32","unstructured":"Sakemi, Y., Kobayashi, T., Saito, T., Wahby, R.S.: Pairing-Friendly Curves. Internet-Draft draft-irtf-cfrg-pairing-friendly-curves-09, Internet Engineering Task Force (2020). https:\/\/datatracker.ietf.org\/doc\/html\/draft-irtf-cfrg-pairing-friendly-curves-09"},{"key":"4_CR33","unstructured":"Shigeo, M.: A portable and fast pairing-based cryptography library. https:\/\/github.com\/herumi\/mcl"},{"issue":"2","key":"4_CR34","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.compeleceng.2011.02.004","volume":"37","author":"KA Shim","year":"2011","unstructured":"Shim, K.A.: Short designated verifier proxy signatures. Comput. Electr. Eng. 37(2), 180\u2013186 (2011)","journal-title":"Comput. Electr. Eng."}],"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-3-031-26553-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T12:14:17Z","timestamp":1680610457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26553-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265525","9783031265532"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26553-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 February 2023","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":"Beijing","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2022","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":"cisc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sklois.cn\/inscrypt2022\/","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":"68","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":"23","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":"3","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":"34% - 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)"}}]}}