Fast batch verification of multiple signatures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4450 LNCS, Issue , 2007, Pages 442-457

  Cheon, Jung Hee ^a   Yi, Jeong Hyun ^b  

^a Seoul National University   (South Korea)

^b Samsung Advanced Institute of Technology (SAIT)   (South Korea)

Author keywords

Batch verification; Elliptic curve; Exponentiation; Frobenius map; Koblitz curve; Non adjacent form; Sparse exponent

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; GRAPH THEORY; VERIFICATION;

BATCH VERIFICATION; ELLIPTIC CURVES; FROBENIUS MAP; KOBLITZ CURVES; MULTIPLE SIGNATURES; SIGNERS; SPARSE EXPONENTS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 38049081057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71677-8_29     Document Type: Conference Paper

References (21)

1. M. Abe, Mix-Networks on Permutation Networks, Advances in Cryptology - Asiacrypt'99, LNCS Vol. 1716, Springer-Verlag, pp. 258-273, 1999.
2. A. Antipa, D. Brown, R. Gallant, R. Lambert, R. Struik, and S. Vanstone, Accelerated Verification of ECDSA Signatures, SAC 2005, LNCS Vol. 3897, pp.307-318, 2006.
3. E. Brickell, D. Gordon, K. McCurley, and D. Wilson, Fast Exponentiation with Precomputation, Eurocrypt'92, LNCS Vol. 658, Springer-Verlag, pp. 200-207, 1993.
4. M. Bellare, J. Garay, and T. Rabin, Fast Batch Verification for Modular Exponentiation and Digital Signatures, Proc. of Eurocrypt '98, LNCS Vol. 1403, Springer-Verlag, pp. 236-250, 1998. Full version is available via http://www-cse.ucsd.edu/users/mihir.
5. C. Boyd and C. Pavlovski, Attacking and Repairing Batch Verification Schemes, Proc. of Asiacrypt 2000, LNCS Vol. 1976, pp. 58-71, Springer-Verlag, 2000.
6. M. Brown, D. Hankerson, J. López, and A. Menezes, Software Implementation of the NIST Elliptic Curves over Primes Fields, Proc. of CT-RSA 2001, LNCS, Vol. 2020, pp. 250-265, Springer-Verlag, 2001.
7. J. Cheon and D. Lee, "Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations," IEEE. T. on Computers, Vol. 55, No. 12, 2006.(December 2006)
8. Digital Signature Standard (DSS) (DSA, RSA, and ECDSA algorithms), Available at http://csrc.nist.gov/cryptval/dss.htm.
9. Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), ANSI X9.62, approved January 7, 1999.
10. P. Feldman, A Practical Scheme for Non-interactive Verifiable Secret Sharing, IEEE Symposium on Foundations of Computer Science, pp. 427-437, 1987.
11. A. Fiat, Batch RSA, J. Cryptology, Vol. 10, No. 2, pp. 75-88, Springer-Verlag, 1997. A preliminary version appeared in Proc. of Crypto'89, LNCS Vol. 435, pp. 175-185, Springer-Verlag, 1989.
12. D. Hankerson, J. Hernandez, and A. Menezes, Software Implementation of Elliptic Curve Cryptography Over Binary Fields, Proc. of CHES 2000, LNCS, Vol. 1965, pp. 1-24, Springer-Verlag, 2000.
13. L. Harn, Batch Verifying Multiple DSA-Type Digital Signatures, Electronic Letters, Vol. 34, No. 9, pp. 870-871, 1995.
14. C.H. Lim and P.J. Lee, More Flexible Exponentiation with Precomputation, Proc. of Crypto '94, LNCS Vol. 839, pp. 95-107, Springer-Verlag, 1994.
15. D. M'Raithi and D. Naccache, Batch Exponentiation - A Fast DLP based Signature Generation Strategy, ACM Conference on Computer and Communications Security, pp. 58-61, ACM, 1996.
16. E. Mykletun, M. Narasimha and G. Tsudik, Authentication and Integrity in Outsourced Databases, Proc. of ISOC Symposium on Network and Distributed Systems Security (NDSS04), 2004.
17. J. Muir and D. Stinson, Minimality and Other Properties of the Width-w Non-Adjacent Form, Mathematics of Computation, Vol. 75, pp. 369-384, 2006.
18. D. Naccache, D. M'Raithi, S. Vaudenay, and D. Raphaeli, Can D.S.A be Improved? Complexity trade-offs with the Digital Signature Standard, Proc. of Eurocrypt '94, LNCS Vol. 950, pp. 77-85, Springer-Verlag, 1994.
19. J. Solinas, An Improved Algorithm for Arithmetic on a Family of Elliptic Curves, Proc. of Crypto 97, pp. 357-371, Springer-Verlag, 1997. Full version is avaiable at http://www.cacr.math.uwaterloo.ca/techreports/
20. J. Solinas, Efficient Arithmetic on Elliptic Curves, Design, Codes and Cryptography, Vol. 19, No. 3, pp. 195-249, 2000.
21. S. Yen and C. Laih, Improved Digital Signature suitable for Batch Verification, IEEE Trans. on Computers, Vol. 44, No. 7, pp. 957-959, 1995.