{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:23:13Z","timestamp":1743106993986,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031649479"},{"type":"electronic","value":"9783031649486"}],"license":[{"start":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T00:00:00Z","timestamp":1728777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T00:00:00Z","timestamp":1728777600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-64948-6_18","type":"book-chapter","created":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T09:02:09Z","timestamp":1728723729000},"page":"350-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Certificateless Aggregate Signature Without Trapdoor for\u00a0Cloud Storage"],"prefix":"10.1007","author":[{"given":"Yingjie","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjian","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhishuo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,13]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2021.102927","volume":"61","author":"H Li","year":"2021","unstructured":"Li, H., et al.: PSCPAC: post-quantum secure certificateless public auditing scheme in cloud storage. J. Inf. Secur. Appl. 61, 102927 (2021). https:\/\/doi.org\/10.1016\/j.jisa.2021.102927","journal-title":"J. Inf. Secur. Appl."},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Salvakkam, D.B., Pamula, R.: An improved lattice based certificateless data integrity verification techniques for cloud computing. J. Ambient Intell. Humaniz. Comput. 14, 1868\u20135145 (2023). https:\/\/doi.org\/10.1007\/s12652-023-04608-7","DOI":"10.1007\/s12652-023-04608-7"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Cash, D.: Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25, 601\u2013639 (2012). https:\/\/doi.org\/10.1007\/s00145-011-9105-2","DOI":"10.1007\/s00145-011-9105-2"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-13013-7_29","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"X Boyen","year":"2010","unstructured":"Boyen, X.: Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_29"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-030-92068-5_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plancon, M., Seiler, G.: Shorter lattice-based group signatures via almost free encryption and\u00a0other optimizations. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 218\u2013248. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_8"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Espitau, T., Tibouchi, M., Wallet, A., Yu, Y.: Shorter hash-and-sign lattice-based signatures. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. CRYPTO 2022. LNCS, vol. 13508, pp. 245\u2013275. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_9","DOI":"10.1007\/978-3-031-15979-4_9"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: How to use a short basis: trapdoors for hard lattices and new cryptographic constructions, Electronic Colloquium on Computational Complexity (ECCC), vol. 14, September 2008","DOI":"10.1145\/1374376.1374407"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-642-29011-4_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Abdalla","year":"2012","unstructured":"Abdalla, M., Fouque, P.-A., Lyubashevsky, V., Tibouchi, M.: Tightly-secure signatures from lossy identification schemes. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 572\u2013590. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_34"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Alwen, C., Peikert, J.: Generating shorter bases for hard random lattices. Theory Comput. Syst. 48 (2011)","DOI":"10.1007\/s00224-010-9278-3"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. J. Cryptol. 31, 774\u2013797 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9270-z","DOI":"10.1007\/s00145-017-9270-z"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-06734-6_21","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"R El Bansarkhani","year":"2014","unstructured":"El Bansarkhani, R., Buchmann, J.: Towards lattice based aggregate signatures. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT 2014. LNCS, vol. 8469, pp. 336\u2013355. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06734-6_21"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/s00145-012-9126-5","volume":"26","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R., Shacham, H., Waters, B.: Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles. J. Cryptol. 26, 340\u2013373 (2013)","journal-title":"J. Cryptol."},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"4816","DOI":"10.1109\/JSYST.2021.3112555","volume":"16","author":"Q Li","year":"2022","unstructured":"Li, Q., Luo, M., Hsu, C., Wang, L., He, D.: A quantum secure and noninteractive identity-based aggregate signature protocol from lattices. IEEE Syst. J. 16(3), 4816\u20134826 (2022). https:\/\/doi.org\/10.1109\/JSYST.2021.3112555","journal-title":"IEEE Syst. J."},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Sato, S., Shikata, J.: Identity-based interactive aggregate signatures from lattices. In: Seo, S.H., Seo, H. (eds.) Information Security and Cryptology \u2013 ICISC 2022. ICISC 2022. LNCS, vol. 13849, pp. 408\u2013432. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-29371-9_20","DOI":"10.1007\/978-3-031-29371-9_20"},{"key":"18_CR18","unstructured":"Boudgoust, K.,\u00a0Roux-Langlois, A.: Compressed linear aggregate signatures based on module lattices, IACR Cryptol. ePrint Arch. (2021). 263. https:\/\/eprint.iacr.org\/2021\/263"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Zhang, L.,\u00a0Zhang, F.: New certificateless aggregate signature scheme. Comput. Commun. 32(6), 1079\u20131085 (2009). cited by: 151. https:\/\/doi.org\/10.1016\/j.comcom.2008.12.042","DOI":"10.1016\/j.comcom.2008.12.042"},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Xiong, H., Guan, Z., Chen, Z., Li, F.: An efficient certificateless aggregate signature with constant pairing computations. Inf. Sci. 219, 225\u2013235 (2013). https:\/\/doi.org\/10.1016\/j.ins.2012.07.004. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025512004689","DOI":"10.1016\/j.ins.2012.07.004"},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Zhang, L., Qin, B., Wu, Q., Zhang, F.: Many-to-one authentication with certificateless aggregate signatures. Comput. Netw. 54(14), 2482\u20132491 (2010). cited by: 111. https:\/\/doi.org\/10.1016\/j.comnet.2010.04.008","DOI":"10.1016\/j.comnet.2010.04.008"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Tian, M.,\u00a0Huang, L.: Certificateless and certificate-based signatures from lattices. Secur. Commun. Netw. 8(8), 1575\u20131586 (2015). https:\/\/doi.org\/10.1002\/sec.1105","DOI":"10.1002\/sec.1105"},{"issue":"2","key":"18_CR23","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1049\/cje.2019.01.019","volume":"28","author":"J Xie","year":"2019","unstructured":"Xie, J., Hu, Y., Gao, J., Jiang, M.: Certificateless sequential aggregate signature scheme on NTRU lattice. Chin. J. Electron. 28(2), 294\u2013300 (2019). https:\/\/doi.org\/10.1049\/cje.2019.01.019","journal-title":"Chin. J. Electron."},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Hung, Y.-H., Tseng, Y.-M., Huang, S.-S.: Lattice-based revocable certificateless signature. Symmetry 9(10) (2017). https:\/\/doi.org\/10.3390\/sym9100242. https:\/\/www.mdpi.com\/2073-8994\/9\/10\/242","DOI":"10.3390\/sym9100242"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Prajapat, S., Kumar, P., Sharma, V.: An efficient CL-signature scheme over NTRU lattices. In: 2022 4th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N), 2022, pp. 1220\u20131224 (2022). https:\/\/doi.org\/10.1109\/ICAC3N56670.2022.10074591","DOI":"10.1109\/ICAC3N56670.2022.10074591"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Yang, Q.,\u00a0Li, D.: Provably secure lattice-based self-certified signature scheme. In: Security and Communication Networks, Hindawi, Cham, pp. 1939\u20130114 (2021)","DOI":"10.1155\/2021\/2459628"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.ins.2019.12.076","volume":"516","author":"Y Yao","year":"2020","unstructured":"Yao, Y., Li, Z., Guo, H.: A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes. Inf. Sci. 516, 505\u2013514 (2020). https:\/\/doi.org\/10.1016\/j.ins.2019.12.076","journal-title":"Inf. Sci."},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Bellare, M.,\u00a0Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the ACM Conference on Computer and Communications Security, pp. 390\u2013399 (2006).https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval, D.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000)","journal-title":"J. Cryptol."},{"key":"18_CR30","doi-asserted-by":"publisher","unstructured":"Micciancio, D.,\u00a0Regev, O.: Worst-case to average-case reductions based on gaussian measures. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 372\u2013381 (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"issue":"6","key":"18_CR31","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. J. ACM 51(6), 899\u2013942 (2004). https:\/\/doi.org\/10.1145\/1039488.1039490","journal-title":"J. ACM"},{"key":"18_CR32","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1137\/S0097539703433511","volume":"34","author":"D Micciancio","year":"2004","unstructured":"Micciancio, D.: Almost perfect lattices, the covering radius problem, and applications to Ajtai\u2019s connection factor. SIAM J. Comput. 34, 118\u2013169 (2004)","journal-title":"SIAM J. Comput."},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145\u2013166. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_8"},{"key":"18_CR35","unstructured":"Ntl (2021). https:\/\/www.shoup.net\/ntl"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64948-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T09:07:56Z","timestamp":1728724076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64948-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,13]]},"ISBN":["9783031649479","9783031649486"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64948-6_18","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024,10,13]]},"assertion":[{"value":"13 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"19 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 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":"securecomm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2023\/","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":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"50","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":"0","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":"28% - 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":"2","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)"}}]}}