{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:37:48Z","timestamp":1758271068830},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262268"},{"type":"electronic","value":"9783540320838"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496618_18","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T20:27:32Z","timestamp":1279052852000},"page":"233-248","source":"Crossref","is-referenced-by-count":37,"title":["Batch Verifications with ID-Based Signatures"],"prefix":"10.1007","author":[{"given":"HyoJin","family":"Yoon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung Hee","family":"Cheon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongdae","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P. Barreto","year":"2002","unstructured":"Barreto, P., Kim, H., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Garay, J., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 236\u2013250. Springer, Heidelberg (1998)"},{"key":"18_CR3","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)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signature from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013531. Springer, Heidelberg (2001), The extended version is available at \n                    \n                      http:\/\/crypto.stanford.edu\/~dabo\/abstracts\/weilsigs.html"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-45146-4_23","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"X. Boyen","year":"2003","unstructured":"Boyen, X.: Multipurpose Identity-Based Signcryption - A Swiss Army Knife for Identity-Based Cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 383\u2013399. Springer, Heidelberg (2003)"},{"key":"18_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 Signatures, Multisignatures and Blind Signatures 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":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-44448-3_5","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"C. Boyd","year":"2000","unstructured":"Boyd, C., Pavlovski, C.: Attacking and Repairing Batch Verification Schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 58\u201371. Springer, Heidelberg (2000)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-36288-6_2","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Cha","year":"2002","unstructured":"Cha, J., Cheon, J.: An ID-based Signature from Gap-Diffie-Hellman Groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 18\u201330. Springer, Heidelberg (2002)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"Y. Desmedt","year":"1987","unstructured":"Desmedt, Y., Quisquater, J.: Public-key Systems based on the Difficulty of Tampering. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 111\u2013117. Springer, Heidelberg (1987)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge Proofs of Identity. J. Cryptology\u00a01, 77\u201394 (1988)","journal-title":"J. Cryptology"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","first-page":"175","volume-title":"Advances in Cryptology - CRYPTO \u201989","year":"1990","unstructured":"Fiat, A.: Batch RSA. J. Cryptology\u00a010(2), 75\u201388 (1997); Brassard, G. (ed.): A preliminary version appeared in Advances in Cryptology - Crypto 1989. LNCS, vol.\u00a0435, pp. 175\u2013185. Springer, Heidelberg (1990)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-45067-X_27","volume-title":"Information Security and Privacy","author":"F. Zhang","year":"2003","unstructured":"Zhang, F., Kim, K.: Efficient ID-based blind signature and proxy signature from bilinear pairings. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 312\u2013323. Springer, Heidelberg (2003)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-36492-7_20","volume-title":"Selected Areas in Cryptography","author":"F. Hess","year":"2003","unstructured":"Hess, F.: Efficient Identity Based Signature Schemes Based on Pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 310\u2013324. Springer, Heidelberg (2003)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-24582-7_20","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"J. Herranz","year":"2003","unstructured":"Herranz, J., S\u00e1ez, G.: Forking Lemmas in Ring Signatures\u2019 Scenario. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol.\u00a02904, pp. 266\u2013279. Springer, Heidelberg (2003)"},{"key":"18_CR16","first-page":"1","volume":"71","author":"K. Itakura","year":"1983","unstructured":"Itakura, K., Nakamura, K.: A Public-key Cryptosystem Suitable for Digital Multisignatures. NEC Research and Development\u00a071, 1\u20138 (1983)","journal-title":"NEC Research and Development"},{"key":"18_CR17","unstructured":"Shamus Software Ltd. Miracl: Multiprecision integer and rational arithmetic c\/c++ library, \n                    \n                      http:\/\/indigo.ie\/~mscott\/"},{"key":"18_CR18","first-page":"58","volume-title":"ACM Conference on Computer and Communications Security","author":"D. M\u2019Raithi","year":"1996","unstructured":"M\u2019Raithi, D., Naccache, D.: Batch Exponentiation - A Fast DLP based Signature Generation Strategy. In: ACM Conference on Computer and Communications Security, pp. 58\u201361. ACM, New York (1996)"},{"key":"18_CR19","unstructured":"Mykletun, E., Narasimha, M., Tsudik, G.: Providing Efficient Data Integrity Mechanisms in Outsourced Databases. Network and Distributed System Security (NDSS) (2004)"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/501983.502017","volume-title":"On proceedings of CCS 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup Multisignatures. In: On proceedings of CCS 2001, pp. 245\u2013254. ACM, New York (2001)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46416-6_39","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"U. Maurer","year":"1991","unstructured":"Maurer, U., Yacobi, Y.: Non-interactive Public-key Cryptography. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 458\u2013460. Springer, Heidelberg (1991)"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0053426","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"D. Naccache","year":"1995","unstructured":"Naccache, D., M\u2019Raithi, D., Vaudenay, S., Raphaeli, D.: Can D.S.A be Improved? Complexity trade-offs with the Digital Signature Standard. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 77\u201385. Springer, Heidelberg (1995)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","first-page":"75","volume-title":"Advances in Cryptology - ASIACRYPT \u201991","author":"K. Ohta","year":"1993","unstructured":"Ohta, K., Okamoto, T.: A Digital Multisignature Scheme based on the Fiat-Shamir Scheme. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 75\u201379. Springer, Heidelberg (1993)"},{"key":"18_CR24","unstructured":"Ohta, K., Okamoto, T.: Multi-signature Schemes Secure against Active Insider Attacks. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E-82-A(1), 21\u201331 (1999)"},{"issue":"18","key":"18_CR25","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1049\/el:20020682","volume":"38","author":"K. Paterson","year":"2002","unstructured":"Paterson, K.: ID-based Signatures from Pairings on Elliptic Curves. Electronics Letters\u00a038(18), 1025\u20131026 (2002)","journal-title":"Electronics Letters"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","first-page":"387","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. J. Cryptology\u00a013(3), 361\u2013396 (2000); Maurer, U.M. (ed.): EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Heidelberg (1996)"},{"key":"18_CR27","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-base Cryptosystems and Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C. Schnorr","year":"1990","unstructured":"Schnorr, C.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-48184-2_29","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"H. Tanaka","year":"1988","unstructured":"Tanaka, H.: A Realization Scheme for the Identity-based Cryptosystem. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 340\u2013349. Springer, Heidelberg (1988)"},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/49.17709","volume":"7","author":"S. Tsuji","year":"1989","unstructured":"Tsuji, S., Itoh, T.: An ID-based Cryptosystem based on the Discrete Logarithm Problem. IEEE Journal of Selected Areas in Communications\u00a07, 467\u2013473 (1989)","journal-title":"IEEE Journal of Selected Areas in Communications"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-45067-X_27","volume-title":"Information Security and Privacy","author":"F. Zhang","year":"2003","unstructured":"Zhang, F., Kim, K.: Efficient ID-based Blind Signature and Proxy Signature from Bilinear Pairings. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 312\u2013323. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496618_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:02:24Z","timestamp":1558296144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496618_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262268","9783540320838"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11496618_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}