{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T17:37:38Z","timestamp":1774892258708,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345466","type":"print"},{"value":"9783540345473","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11761679_28","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T14:11:19Z","timestamp":1152022279000},"page":"465-485","source":"Crossref","is-referenced-by-count":226,"title":["Sequential Aggregate Signatures and Multisignatures Without Random Oracles"],"prefix":"10.1007","author":[{"given":"Steve","family":"Lu","sequence":"first","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Hovav","family":"Shacham","sequence":"additional","affiliation":[]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE J. Selected Areas in Comm.\u00a018(4), 593\u2013610 (2000)","journal-title":"IEEE J. Selected Areas in Comm."},{"key":"28_CR2","unstructured":"Bao, F., Deng, R., Mao, W.: Efficient and practical fair exchange protocols with offline TTP. In: Karger, P., Gong, L. (eds.) Proceedings of IEEE Security & Privacy, pp. 77\u201385 (May 1998)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P. Barreto","year":"2006","unstructured":"Barreto, P., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 614\u2013629. Springer, Heidelberg (2003)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11681878_4","volume-title":"Theory of Cryptography","author":"A. Bender","year":"2006","unstructured":"Bender, A., Katz, J., Morselli, R.: Ring signatures: Stronger definitions, and constructions without random oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 60\u201379. Springer, Heidelberg (2006)"},{"key":"28_CR6","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 - PKC 2003","author":"A. Boldyreva","year":"2002","unstructured":"Boldyreva, A.: Threshold signature, multisignature and blind signature schemes based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 31\u201346. Springer, Heidelberg (2002)"},{"key":"28_CR7","unstructured":"Boldyreva, A., Palacio, A., Warinschi, B.: Secure proxy signature schemes for delegation of signing rights. Cryptology ePrint Archive, Report 2003\/096 (2003), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"28_CR8","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 \u2013 EUROCRPYT 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.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptology\u00a017(4), 297\u2013319 (2004) (extended abstract in Proceedings of Asiacrypt 2001)","journal-title":"J. Cryptology"},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11734727_33","volume-title":"Information Security and Cryptology - ICISC 2005","author":"S. Chatterjee","year":"2006","unstructured":"Chatterjee, S., Sarkar, P.: Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol.\u00a03935, pp. 424\u2013440. Springer, Heidelberg (2006)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-540-40061-5_25","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"J.-S. Coron","year":"2003","unstructured":"Coron, J.-S., Naccache, D.: Boneh et al.\u2019s k-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 392\u2013397. Springer, Heidelberg (2003)"},{"key":"28_CR13","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1017\/CBO9780511546570.011","volume-title":"Advances in Elliptic Curve Cryptography","author":"S. Galbraith","year":"2005","unstructured":"Galbraith, S.: Pairings. In: Blake, I.F., Seroussi, G., Smart, N. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Notes, vol.\u00a0ch.\u00a0IX, vol. 317, pp. 183\u2013213. Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"28_CR14","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.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. Computing"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11761679_21","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 339\u2013358. Springer, Heidelberg (2006)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-24632-9_21","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"R. Hayashi","year":"2004","unstructured":"Hayashi, R., Okamoto, T., Tanaka, K.: An RSA family of trap-door permutations with a common domain and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 291\u2013304. Springer, Heidelberg (2004)"},{"key":"28_CR17","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.\u00a071, 1\u20138 (1983)","journal-title":"NEC J. Res. & Dev."},{"issue":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/49.839934","volume":"18","author":"S. Kent","year":"2000","unstructured":"Kent, S., Lynn, C., Seo, K.: Secure border gateway protocol (Secure-BGP). IEEE J. Selected Areas in Comm.\u00a018(4), 582\u2013592 (2000)","journal-title":"IEEE J. Selected Areas in Comm."},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"key":"28_CR20","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.\u00a03027, pp. 74\u201390. Springer, Heidelberg (2004)"},{"key":"28_CR21","first-page":"48","volume-title":"Proceedings of CCS 1996","author":"M. Mambo","year":"1996","unstructured":"Mambo, M., Usuda, K., Okamoto, E.: Proxy signatures for delegating signing operation. In: Gong, L., Stearn, J. (eds.) Proceedings of CCS 1996, pp. 48\u201357. ACM Press, New York (1996)"},{"key":"28_CR22","first-page":"245","volume-title":"Proceedings of CCS 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures (extended abstract). In: Samarati, P. (ed.) Proceedings of CCS 2001, pp. 245\u2013254. ACM Press, New York (2001)"},{"key":"28_CR23","unstructured":"Naccache, D.: Secure and practical identity-based encryption. Cryptology ePrint Archive, Report 2005\/369 (2005), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.simpat.2003.10.003","volume":"12","author":"D. Nicol","year":"2004","unstructured":"Nicol, D., Smith, S., Zhao, M.: Evaluation of efficient security for BGP route announcements using parallel simulation. Simulation Modelling Practice and Theory\u00a012, 187\u2013216 (2004)","journal-title":"Simulation Modelling Practice and Theory"},{"issue":"1","key":"28_CR25","first-page":"21","volume":"E82-A","author":"K. Ohta","year":"1999","unstructured":"Ohta, K., Okamoto, T.: Multisignature schemes secure against active insider attacks. IEICE Trans. Fundamentals\u00a0E82-A(1), 21\u201331 (1999)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"4","key":"28_CR26","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. ACM Trans. Computer Systems\u00a06(4), 432\u2013441 (1988)","journal-title":"ACM Trans. Computer Systems"},{"key":"28_CR27","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1017\/CBO9780511546570.012","volume-title":"Advances in Elliptic Curve Cryptography","author":"K. Paterson","year":"2005","unstructured":"Paterson, K.: Cryptography from pairings. In: Blake, I.F., Seroussi, G., Smart, N. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Notes, ch.\u00a0X, vol.\u00a0317, pp. 215\u2013251. Cambridge University Press, Cambridge (2005)"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11761679_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T02:07:43Z","timestamp":1552356463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11761679_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345466","9783540345473"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11761679_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}