{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:33:11Z","timestamp":1773513191372,"version":"3.50.1"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159787","type":"print"},{"value":"9783031159794","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15979-4_26","type":"book-chapter","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T16:25:31Z","timestamp":1665591931000},"page":"761-791","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Locally Verifiable Signature and\u00a0Key Aggregation"],"prefix":"10.1007","author":[{"given":"Rishab","family":"Goyal","sequence":"first","affiliation":[]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Ahn, J.H., Green, M., Hohenberger, S.: Synchronized aggregate signatures: new definitions, constructions and applications. In: CCS (2010)","DOI":"10.1145\/1866307.1866360"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 160(2), 781\u2013793 (2004)","journal-title":"Ann. Math."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-28628-8_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Secure identity based encryption without random oracles. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 443\u2013459. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_27"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_4"},{"key":"26_CR5","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":"26_CR6","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: I. A survey of two signature aggregation techniques. CryptoBytes (2003)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Gentry, C., O\u2019Neill, A., Yum, D.H.: Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. In: CCS (2007)","DOI":"10.1145\/1315245.1315280"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ic.2014.07.001","volume":"239","author":"K Brogle","year":"2014","unstructured":"Brogle, K., Goldberg, S., Reyzin, L.: Sequential aggregate signatures with lazy verification from trapdoor permutations. Inf. Comput. 239, 356\u2013376 (2014)","journal-title":"Inf. Comput."},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-13013-7_28","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"A Bagherzandi","year":"2010","unstructured":"Bagherzandi, A., Jarecki, S.: Identity-based aggregate and multi-signature schemes based on RSA. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 480\u2013498. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_28"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Langley, A., Laurie, B., Kasper, E.: Certificate transparency (2013). https:\/\/datatracker.ietf.org\/doc\/html\/rfc6962","DOI":"10.17487\/rfc6962"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-319-45871-7_25","volume-title":"Information Security","author":"R El Bansarkhani","year":"2016","unstructured":"El Bansarkhani, R., Mohamed, M.S.E., Petzoldt, A.: MQSAS - a multivariate sequential aggregate signature scheme. In: Bishop, M., Nascimento, A.C.A. (eds.) ISC 2016. LNCS, vol. 9866, pp. 426\u2013439. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45871-7_25"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11967668_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Neven, G.: Identity-based multi-signatures from RSA. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 145\u2013162. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11967668_10"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-73420-8_37","volume-title":"Automata, Languages and Programming","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Namprempre, C., Neven, G.: Unrestricted aggregate signatures. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 411\u2013422. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_37"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"N Bari\u0107","year":"1997","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480\u2013494. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_33"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: CCS (1993)","DOI":"10.1145\/168588.168596"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-68697-5_14","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"R Cramer","year":"1996","unstructured":"Cramer, R., Damg\u00e5rd, I.: New generation of secure and practical RSA-based signatures. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 173\u2013185. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_14"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_28"},{"issue":"3","key":"26_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. TISSEC 3(3), 161\u2013185 (2000)","journal-title":"TISSEC"},{"key":"26_CR20","unstructured":"Certificate transparency project. https:\/\/certificate.transparency.dev\/"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-48965-0_13","volume-title":"Cryptology and Network Security","author":"D Derler","year":"2016","unstructured":"Derler, D., Krenn, S., Slamanig, D.: Signer-anonymous designated-verifier redactable signatures for cloud-based data sharing. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 211\u2013227. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_13"},{"key":"26_CR22","unstructured":"De la Vall\u00e9e Poussin, C.-J.: Recherches analytiques sur la th\u00e9orie des nombres premiers. Hayez, Imprimeur de l\u2019Acad\u00e9mie royale de Belgique (1897)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-48658-5_23","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"C Dwork","year":"1994","unstructured":"Dwork, C., Naor, M.: An efficient existentially unforgeable signature scheme and its applications. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 234\u2013246. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_23"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-85174-5_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Delerabl\u00e9e","year":"2008","unstructured":"Delerabl\u00e9e, C., Pointcheval, D.: Dynamic threshold public-key encryption. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 317\u2013334. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_18"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-73489-5_4","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"C Delerabl\u00e9e","year":"2007","unstructured":"Delerabl\u00e9e, C., Paillier, P., Pointcheval, D.: Fully collusion secure dynamic broadcast encryption with constant-size ciphertexts or decryption keys. In: Takagi, T., Okamoto, E., Okamoto, T., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 39\u201359. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73489-5_4"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30840-1_1","volume-title":"Information Security and Cryptology - ICISC 2015","author":"D Derler","year":"2016","unstructured":"Derler, D., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: A general framework for redactable signatures and new constructions. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 3\u201319. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_1"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-642-40041-4_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"ESV Freire","year":"2013","unstructured":"Freire, E.S.V., Hofheinz, D., Paterson, K.G., Striecks, C.: Programmable hash functions in the multilinear setting. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 513\u2013530. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_28"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/0-387-34805-0_17","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"A Fiat","year":"1990","unstructured":"Fiat, A.: Batch RSA. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 175\u2013185. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_17"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-36288-6_9","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"M Fischlin","year":"2003","unstructured":"Fischlin, M.: The Cramer-Shoup strong-RSA signature scheme revisited. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 116\u2013129. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_9"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-32928-9_7","volume-title":"Security and Cryptography for Networks","author":"M Fischlin","year":"2012","unstructured":"Fischlin, M., Lehmann, A., Schr\u00f6der, D.: History-free sequential aggregate signatures. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 113\u2013130. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32928-9_7"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Gennaro","year":"1999","unstructured":"Gennaro, R., Halevi, S., Rabin, T.: Secure hash-and-sign signatures without the random oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123\u2013139. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_9"},{"issue":"2","key":"26_CR32","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"26_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252","volume-title":"Introduction to Property Testing","author":"O Goldreich","year":"2017","unstructured":"Goldreich, O.: Introduction to Property Testing. Cambridge University Press, Cambridge (2017)"},{"key":"26_CR34","unstructured":"Gorbunov, S.: How not to use aggregate signatures in your blockchain (2018)"},{"key":"26_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11745853_17","volume-title":"Public Key Cryptography - PKC 2006","author":"C Gentry","year":"2006","unstructured":"Gentry, C., Ramzan, Z.: Identity-based aggregate signatures. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 257\u2013273. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_17"},{"key":"26_CR36","unstructured":"Goyal, R., Vaikuntanathan, V.: Locally verifiable signature and key aggregation. Cryptology ePrint Archive, Paper 2022\/179 (2022). https:\/\/eprint.iacr.org\/2022\/179"},{"key":"26_CR37","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"26_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46803-6_1","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Hohenberger","year":"2015","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Universal signature aggregators. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 3\u201334. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_1"},{"key":"26_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-642-40041-4_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Hohenberger","year":"2013","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 494\u2013512. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_27"},{"key":"26_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-78375-8_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Hohenberger","year":"2018","unstructured":"Hohenberger, S., Waters, B.: Synchronized aggregate signatures from the RSA assumption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 197\u2013229. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_7"},{"key":"26_CR41","first-page":"1","volume":"71","author":"K Itakura","year":"1983","unstructured":"Itakura, K., Nakamura, K.: A public-key cryptosystem suitable for digital multisignatures. NEC J. Res. Dev. 71, 1\u20138 (1983)","journal-title":"NEC J. Res. Dev."},{"key":"26_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"R Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_17"},{"key":"26_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-38980-1_13","volume-title":"Applied Cryptography and Network Security","author":"K Lee","year":"2013","unstructured":"Lee, K., Lee, D.H., Yung, M.: Sequential aggregate signatures made shorter. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 202\u2013217. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_13"},{"key":"26_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-36362-7_26","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"K Lee","year":"2013","unstructured":"Lee, K., Lee, D.H., Yung, M.: Sequential aggregate signatures with short public keys: design, analysis and implementation studies. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 423\u2013442. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_26"},{"key":"26_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-24676-3_5","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A Lysyanskaya","year":"2004","unstructured":"Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 74\u201390. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_5"},{"key":"26_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11761679_28","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S Lu","year":"2006","unstructured":"Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 465\u2013485. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_28"},{"key":"26_CR47","doi-asserted-by":"crossref","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures. In: CCS (2001)","DOI":"10.1145\/502014.502017"},{"key":"26_CR48","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: FOCS (1999)"},{"issue":"2","key":"26_CR49","first-page":"481","volume":"85","author":"S Mitsunari","year":"2002","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85(2), 481\u2013484 (2002)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"26_CR50","doi-asserted-by":"crossref","unstructured":"Ma, D., Tsudik, G.: Forward-secure sequential aggregate authentication. In: SP (2007)","DOI":"10.1109\/SP.2007.18"},{"key":"26_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-78967-3_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Neven","year":"2008","unstructured":"Neven, G.: Efficient sequential aggregate signed data. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 52\u201369. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_4"},{"issue":"4","key":"26_CR52","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1145\/48012.48246","volume":"6","author":"T Okamoto","year":"1988","unstructured":"Okamoto, T.: A digital multisignature scheme using bijective public-key cryptosystems. TOCS 6(4), 432\u2013441 (1988)","journal-title":"TOCS"},{"issue":"1","key":"26_CR53","first-page":"21","volume":"82","author":"K Ohta","year":"1999","unstructured":"Ohta, K., Okamoto, T.: Multi-signature schemes secure against active insider attacks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 82(1), 21\u201331 (1999)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1","key":"26_CR54","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"MO Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. J. Number Theory 12(1), 128\u2013138 (1980)","journal-title":"J. Number Theory"},{"key":"26_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/978-3-642-02617-1_76","volume-title":"Advances in Information Security and Assurance","author":"M R\u00fcckert","year":"2009","unstructured":"R\u00fcckert, M., Schr\u00f6der, D.: Aggregate and verifiably encrypted signatures from multilinear maps without random oracles. In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol. 5576, pp. 750\u2013759. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02617-1_76"},{"key":"26_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45861-1_22","volume-title":"Information Security and Cryptology \u2014 ICISC 2001","author":"R Steinfeld","year":"2002","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 285\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45861-1_22"},{"issue":"1","key":"26_CR57","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A Shamir","year":"1983","unstructured":"Shamir, A.: On the generation of cryptographically strong pseudorandom sequences. ACM Trans. Comput. Syst. 1(1), 38\u201344 (1983)","journal-title":"ACM Trans. Comput. Syst."},{"key":"26_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_5"},{"issue":"1","key":"26_CR59","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R Solovay","year":"1977","unstructured":"Solovay, R., Strassen, V.: A fast Monte-Carlo test for primality. SIAM J. Comput. 6(1), 84\u201385 (1977)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"26_CR60","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1467247.1467267","volume":"52","author":"M Sudan","year":"2009","unstructured":"Sudan, M.: Probabilistically checkable proofs. Commun. ACM 52(3), 76\u201384 (2009)","journal-title":"Commun. ACM"},{"issue":"3","key":"26_CR61","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1561\/0400000030","volume":"6","author":"S Yekhanin","year":"2012","unstructured":"Yekhanin, S.: Locally decodable codes. Found. Trends Theor. Comput. Sci. 6(3), 139\u2013255 (2012)","journal-title":"Found. Trends Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15979-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:03:09Z","timestamp":1760220189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15979-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159787","9783031159794"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15979-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}