{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:30Z","timestamp":1772283750065,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662493830","type":"print"},{"value":"9783662493847","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-662-49384-7_13","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T00:24:21Z","timestamp":1455927861000},"page":"331-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Fault-Tolerant Aggregate Signatures"],"prefix":"10.1007","author":[{"given":"Gunnar","family":"Hartung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Kaidel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Koch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessica","family":"Koch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Rupp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ahn, J.H., Green, M., Hohenberger, S.: Synchronized aggregate signatures: new definitions, constructions and applications. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) CCS 2010, pp. 473\u2013484. ACM Press, October 2010","DOI":"10.1145\/1866307.1866360"},{"key":"13_CR2","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). doi:10.1016\/j.ic.2014.07.001","journal-title":"Inf. Comput."},{"key":"13_CR3","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)"},{"key":"13_CR4","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)"},{"key":"13_CR5","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: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) CCS 2007, pp. 276\u2013285. ACM Press, October 2007","DOI":"10.1145\/1315245.1315280"},{"key":"13_CR6","first-page":"416","volume-title":"Lecture Notes in Computer Science","author":"Dan 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, vol. 2656. LNCS, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-76900-2_31","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R Cramer","year":"2007","unstructured":"Cramer, R., Hanaoka, G., Hofheinz, D., Imai, H., Kiltz, E., Pass, R., Shelat, A., Vaikuntanathan, V.: Bounded CCA2-secure encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 502\u2013518. Springer, Heidelberg (2007)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-1-4757-6048-4_22","volume-title":"Numbers, Information and Complexity","author":"AG Dyachkov","year":"2000","unstructured":"Dyachkov, A.G., Macula, A.J., Rykov, V.V.: New applications and results of superimposed code theory arising from the potentialities of molecular biology. In: Alth\u00f6fer, I., Cai, N., Dueck, G., Khachatrian, L., Pinsker, M.S., S\u00e1rk\u00f6zy, A., Wegener, I., Zhang, Z. (eds.) Numbers, Information and Complexity, pp. 265\u2013282. Springer, Heidelberg (2000)"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/18.817530","volume":"46","author":"AG Dyachkov","year":"2000","unstructured":"Dyachkov, A.G., Macula, A.J., Rykov, V.V.: New constructions of superimposed codes. IEEE Trans. Inf. Theory 46(1), 284\u2013290 (2000). doi:10.1109\/18.817530","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-46035-7_5","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y Dodis","year":"2002","unstructured":"Dodis, Y., Katz, J., Xu, S., Yung, M.: Key-insulated public key cryptosystems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 65\u201382. Springer, Heidelberg (2002)"},{"issue":"3","key":"13_CR11","first-page":"7","volume":"18","author":"AG Dyachkov","year":"1982","unstructured":"Dyachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii 18(3), 7\u201313 (1982)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/jcta.1996.0012","volume":"73","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On \n\n$$r$$\n\n-cover-free families. J. Comb. Theory, Ser. A 73(1), 172\u2013173 (1996). doi:10.1006\/jcta.1996.0012","journal-title":"J. Comb. Theory, Ser. A"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-34961-4_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M Gerbush","year":"2012","unstructured":"Gerbush, M., Lewko, A., O\u2019Neill, A., Waters, B.: Dual form signatures: an approach for proving security from static assumptions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 25\u201342. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34961-4_4"},{"key":"13_CR14","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)"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1093\/comjnl\/bxh153","volume":"49","author":"J Herranz","year":"2006","unstructured":"Herranz, J.: Deterministic identity-based signatures for partial aggregation. Comput. J. 49(3), 322\u2013330 (2006). doi:10.1093\/comjnl\/bxh153","journal-title":"Comput. J."},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-642-25385-0_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Hofheinz","year":"2011","unstructured":"Hofheinz, D., Jager, T., Kiltz, E.: Short signatures from weaker assumptions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 647\u2013666. Springer, Heidelberg (2011)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-24660-2_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"S-H Heng","year":"2004","unstructured":"Heng, S.-H., Kurosawa, K.: k-resilient identity-based encryption in the standard model. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 67\u201380. Springer, Heidelberg (2004)"},{"key":"13_CR18","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. LNCS, vol. 9057, pp. 3\u201334. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46803-6_1"},{"key":"13_CR19","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). doi:10.1007\/978-3-642-40041-4_27"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R Kumar","year":"1999","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 609\u2013623. Springer, Heidelberg (1999)"},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10(4), 363\u2013377 (1964). doi:10.1109\/TIT.1964.1053689","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2015.02.01923","volume":"579","author":"K Lee","year":"2015","unstructured":"Lee, K., Lee, D.H., Yung, M.: Sequential aggregate signatures with short public keys without random oracles. Theor. Comput. Sci. 579, 100\u2013125 (2015). doi:10.1016\/j.tcs.2015.02.01923","journal-title":"Theor. Comput. Sci."},{"key":"13_CR23","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)"},{"issue":"6","key":"13_CR24","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1002\/jcd.20109","volume":"14","author":"P Li","year":"2006","unstructured":"Li, P., Van Rees, G., Wei, R.: Constructions of 2-cover-free families and related separating hash families. J. Comb. Des. 14(6), 423\u2013440 (2006)","journal-title":"J. Comb. Des."},{"key":"13_CR25","unstructured":"Lebedev, V., Vilenkin, P., Yekhanin, S.: Cover-free families and superimposed codes: constructions, bounds, and applications to cryptography and group testing. In: IEEE International Symposium on Information Theory (2001)"},{"key":"13_CR26","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)"},{"issue":"1","key":"13_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502777.1502779","volume":"5","author":"Di Ma","year":"2009","unstructured":"Ma, D., Tsudik, G.: A new approach to secure logging. TOS 5(1) (2009). doi:10.1145\/1502777.1502779","journal-title":"ACM Transactions on Storage"},{"key":"13_CR28","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.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 52\u201369. Springer, Heidelberg (2008)"},{"issue":"2","key":"13_CR29","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the upper bound of the size of the \n\n$$r$$\n\n-cover-free families. J. Comb. Theory, Ser. A 66(2), 302\u2013310 (1994). doi:10.1016\/0097-3165(94)90067-1","journal-title":"J. Comb. Theory, Ser. A"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-23822-2_17","volume-title":"Computer Security \u2013 ESORICS 2011","author":"D Schr\u00f6der","year":"2011","unstructured":"Schr\u00f6der, D.: How to aggregate the CL signature scheme. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 298\u2013314. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23822-2_17"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"1997","unstructured":"Stinson, D.R., Trung, T.V., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plann. Infer. 86, 595\u2013617 (1997)","journal-title":"J. Stat. Plann. Infer."},{"issue":"1\u20132","key":"13_CR32","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/inco.1998.2769","volume":"151","author":"R Safavi-Naini","year":"1999","unstructured":"Safavi-Naini, R., Wang, H.: Multireceiver authentication codes: models, bounds, constructions, and extensions. Inf. Comput. 151(1\u20132), 148\u2013172 (1999). doi:10.1006\/inco.1998.2769","journal-title":"Inf. Comput."},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/11767480_6","volume-title":"Applied Cryptography and Network Security","author":"D Tonien","year":"2006","unstructured":"Tonien, D., Safavi-Naini, R.: An efficient single-key pirates tracing scheme using cover-free families. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 82\u201397. Springer, Heidelberg (2006)"},{"issue":"3","key":"13_CR34","doi-asserted-by":"publisher","first-page":"473","DOI":"10.3934\/amc.2011.5.473","volume":"5","author":"GM Zaverucha","year":"2011","unstructured":"Zaverucha, G.M., Stinson, D.R.: Short one-time signatures. Adv. Math. Comm. 5(3), 473\u2013488 (2011). doi:10.3934\/amc.2011.5.473","journal-title":"Adv. Math. Comm."}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49384-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,4]],"date-time":"2021-02-04T14:42:23Z","timestamp":1612449743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49384-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493830","9783662493847"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49384-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"18 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}