{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:33:21Z","timestamp":1762004001914},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716761"},{"type":"electronic","value":"9783540716778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71677-8_29","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T18:05:58Z","timestamp":1182362758000},"page":"442-457","source":"Crossref","is-referenced-by-count":28,"title":["Fast Batch Verification of Multiple Signatures"],"prefix":"10.1007","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeong Hyun","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M. Abe","year":"1999","unstructured":"Abe, M.: Mix-Networks on Permutation Networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/11693383_21","volume-title":"Selected Areas in Cryptography","author":"A. Antipa","year":"2006","unstructured":"Antipa, A., Brown, D., Gallant, R., Lambert, R., Struik, R., Vanstone, S.: Accelerated Verification of ECDSA Signatures. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 307\u2013318. Springer, Heidelberg (2006)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E. Brickell","year":"1993","unstructured":"Brickell, E., Gordon, D., McCurley, K., Wilson, D.: Fast Exponentiation with Precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993)"},{"key":"29_CR4","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), Full version is available via http:\/\/www-cse.ucsd.edu\/users\/mihir"},{"key":"29_CR5","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":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves over Primes Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 250\u2013265. Springer, Heidelberg (2001)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Cheon, J., Lee, D.: Use of Sparse and\/or Complex Exponents in Batch Verification of Exponentiations. IEEE. T. on Computers\u00a055(12) (2006)","DOI":"10.1109\/TC.2006.207"},{"key":"29_CR8","unstructured":"Digital Signature Standard (DSS) (DSA, RSA, and ECDSA algorithms). Available at http:\/\/csrc.nist.gov\/cryptval\/dss.htm"},{"key":"29_CR9","unstructured":"Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), ANSI X9.62, approved January 7 (1999)"},{"key":"29_CR10","first-page":"427","volume-title":"IEEE Symposium on Foundations of Computer Science","author":"P. Feldman","year":"1987","unstructured":"Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: IEEE Symposium on Foundations of Computer Science, pp. 427\u2013437. IEEE Computer Society Press, Los Alamitos (1987)"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s001459900021","volume":"10","author":"A. Fiat","year":"1997","unstructured":"Fiat, A.: Batch RSA. Computing Methods in Applied Sciences and Engineering. International Symposium, Versailles, December 17-21, 1973\u00a010(2), 175\u2013185 (1997), A preliminary version appeared in: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 175\u2013185. Springer, Heidelberg (1990)","journal-title":"J. Cryptology"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44499-8_1","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"D. Hankerson","year":"2000","unstructured":"Hankerson, D., Hernandez, J., Menezes, A.: Software Implementation of Elliptic Curve Cryptography Over Binary Fields. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 1\u201324. Springer, Heidelberg (2000)"},{"issue":"9","key":"29_CR13","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1049\/el:19980620","volume":"34","author":"L. Harn","year":"1995","unstructured":"Harn, L.: Batch Verifying Multiple DSA-Type Digital Signatures. Electronic Letters\u00a034(9), 870\u2013871 (1995)","journal-title":"Electronic Letters"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More Flexible Exponentiation with Precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 95\u2013107. Springer, Heidelberg (1994)"},{"key":"29_CR15","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 Press, New York (1996)"},{"key":"29_CR16","unstructured":"Mykletun, E., Narasimha, M., Tsudik, G.: Authentication and Integrity in Outsourced Databases. In: Proc. of ISOC Symposium on Network and Distributed Systems Security (NDSS\u201904) (2004)"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1090\/S0025-5718-05-01769-2","volume":"75","author":"J. Muir","year":"2006","unstructured":"Muir, J., Stinson, D.: Minimality and Other Properties of the Width-w Non-Adjacent Form. Mathematics of Computation\u00a075, 369\u2013384 (2006)","journal-title":"Mathematics of Computation"},{"key":"29_CR18","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":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Solinas","year":"1997","unstructured":"Solinas, J.: An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 357\u2013371. Springer, Heidelberg (1997), Full version is available at http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/"},{"issue":"3","key":"29_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J. Solinas","year":"2000","unstructured":"Solinas, J.: Efficient Arithmetic on Elliptic Curves. Design, Codes and Cryptography\u00a019(3), 195\u2013249 (2000)","journal-title":"Design, Codes and Cryptography"},{"issue":"7","key":"29_CR21","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/12.392857","volume":"44","author":"S. Yen","year":"1995","unstructured":"Yen, S., Laih, C.: Improved Digital Signature suitable for Batch Veriffication. IEEE Trans. on Computers\u00a044(7), 957\u2013959 (1995)","journal-title":"IEEE Trans. on Computers"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71677-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:24:41Z","timestamp":1605763481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71677-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540716761","9783540716778"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71677-8_29","relation":{},"subject":[]}}