Abstract
We propose an efficient batch verification of multiple signatures generated by different signers as well as a single signer. We first introduce a method to generate width-w Non-Adjacent Forms (w-NAFs) uniformly. We then propose a batch verification algorithm of exponentiations using w-NAF exponents, and apply this to batch verification for the modified DSA and ECDSA signatures. The performance analysis shows that our proposed method is asymptotically seven and four times as fast as individual verification in case of a single signer and multiple signers, respectively. Further, the proposed algorithm can be generalized into τ-adic w-NAFs over Koblitz curves and requires asymptotically only six elliptic curve additions per each signature for batch verification of the modified ECDSA signatures by a single singer. Our result is the first one to efficiently verify multiple signatures by multiple signers that can introduce much wider applications.
Keywords
- Batch verification
- exponentiation
- sparse exponent
- non-adjacent form
- elliptic curve
- Koblitz curve
- Frobenius map
Chapter PDF
References
Abe, M.: Mix-Networks on Permutation Networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 258–273. Springer, Heidelberg (1999)
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. 3897, pp. 307–318. Springer, Heidelberg (2006)
Brickell, E., Gordon, D., McCurley, K., Wilson, D.: Fast Exponentiation with Precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 200–207. Springer, Heidelberg (1993)
Bellare, M., Garay, J., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236–250. Springer, Heidelberg (1998), Full version is available via http://www-cse.ucsd.edu/users/mihir
Boyd, C., Pavlovski, C.: Attacking and Repairing Batch Verification Schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 58–71. Springer, Heidelberg (2000)
Brown, M., Hankerson, D., López, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves over Primes Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 250–265. Springer, Heidelberg (2001)
Cheon, J., Lee, D.: Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations. IEEE. T. on Computers 55(12) (2006)
Digital Signature Standard (DSS) (DSA, RSA, and ECDSA algorithms). Available at http://csrc.nist.gov/cryptval/dss.htm
Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), ANSI X9.62, approved January 7 (1999)
Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: IEEE Symposium on Foundations of Computer Science, pp. 427–437. IEEE Computer Society Press, Los Alamitos (1987)
Fiat, A.: Batch RSA. Computing Methods in Applied Sciences and Engineering. International Symposium, Versailles, December 17-21, 1973 10(2), 175–185 (1997), A preliminary version appeared in: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 175–185. Springer, Heidelberg (1990)
Hankerson, D., Hernandez, J., Menezes, A.: Software Implementation of Elliptic Curve Cryptography Over Binary Fields. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 1–24. Springer, Heidelberg (2000)
Harn, L.: Batch Verifying Multiple DSA-Type Digital Signatures. Electronic Letters 34(9), 870–871 (1995)
Lim, C.H., Lee, P.J.: More Flexible Exponentiation with Precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95–107. Springer, Heidelberg (1994)
M’Raithi, D., Naccache, D.: Batch Exponentiation - A Fast DLP based Signature Generation Strategy. In: ACM Conference on Computer and Communications Security, pp. 58–61. ACM Press, New York (1996)
Mykletun, E., Narasimha, M., Tsudik, G.: Authentication and Integrity in Outsourced Databases. In: Proc. of ISOC Symposium on Network and Distributed Systems Security (NDSS’04) (2004)
Muir, J., Stinson, D.: Minimality and Other Properties of the Width-w Non-Adjacent Form. Mathematics of Computation 75, 369–384 (2006)
Naccache, D., M’Raithi, 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. 950, pp. 77–85. Springer, Heidelberg (1995)
Solinas, J.: An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 357–371. Springer, Heidelberg (1997), Full version is available at http://www.cacr.math.uwaterloo.ca/techreports/
Solinas, J.: Efficient Arithmetic on Elliptic Curves. Design, Codes and Cryptography 19(3), 195–249 (2000)
Yen, S., Laih, C.: Improved Digital Signature suitable for Batch Veriffication. IEEE Trans. on Computers 44(7), 957–959 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Cheon, J.H., Yi, J.H. (2007). Fast Batch Verification of Multiple Signatures. In: Okamoto, T., Wang, X. (eds) Public Key Cryptography – PKC 2007. PKC 2007. Lecture Notes in Computer Science, vol 4450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71677-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-71677-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71676-1
Online ISBN: 978-3-540-71677-8
eBook Packages: Computer ScienceComputer Science (R0)