Efficient identification of bad signatures in RSA-type batch signature

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 1, 2006, Pages 74-80

  Lee, Seungwon ^a   Cho, Seongje ^b   Choi, Jongmoo ^b   Cho, Yookun ^a,c,d,e  

^a Seoul National University   (South Korea)

^b Dankook University   (South Korea)

^c Department of Computer Engineering ^*

^d ACM   (South Korea)

^e KISS   (South Korea)

Author keywords

Batch identification; Batch verification; RSA

Indexed keywords

ELECTRONIC COMMERCE; ELECTRONIC EQUIPMENT; IDENTIFICATION (CONTROL SYSTEMS); VOTING MACHINES;

BATCH IDENTIFICATION; BATCH VERIFICATION; RSA;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 32244432588     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.1.74     Document Type: Article

References (16)

1. M. Bellare, J. Garay, and T. Rabin, "Fast batch verification for modular exponentiation and digital signatures," Advances in Cryptology - EUROCRYPT'98, no.1403, pp.236-250, 1998.
2. L. Harn, "Batch verifying multiple RSA-type digital signatures," Electron. Lett., vol.34, pp.1219-1220, 1998.
3. D. Naccache, D.M'Raiya, S. Vaudenay, and D. Raphaeli, "Can DSA be improved? Complexity trade-offs with the digital signature standard," Eurocrypt'94, pp.77-85, 1994.
4. S. Yen and C. Laih, "Improved digital signature suitable for batch certification," IEEE Trans. Comput., vol.44, no.7, pp.957-959, 1995.
5. D. Marihi and D. Naccache, "Batch exponentiation - A fast DLP-based signature generation strategy," 3rd ACM Conference on Computer and Communications Security, pp.58-61, 1996.
6. L. Harn, "Batch verifying multiple DSA-type digital signatures," Electron. Lett., vol.34, pp.870-871, 1998.
7. J. Pastuszak, D. Michalek, J. Pieprzyk, and J. Seberry, "Identification of bad signatures in batches," PKC 2000, 2000.
8. M. Bellare, J.A. Garay, and T. Rabin, "Batch verification with applications to cryptography and checking," Lecture Notes in Computer Science, vol.1380, 1998.
9. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, 1968.
10. B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, Wiley, 1996.
11. E. Teske, "Computing discrete logarithms with the parallelized kangaroo method," Discrete Appl. Math., vol.130, pp.61-82, 2003.
12. J. Buchmann, M. Jacobson, and E. Teske, "On some computational problems in finite Abelian groups," Mathematics of Computation, vol.66, no.220, pp. 1663-1687, 1997.
13. J.-S. Coron and D. Naccache, "On the security of RSA screening," PKC99, pp. 197-203, 1999.
14. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
15. J. Sauerbrey and A. Dietel, "Resource requirements for the application of addition chains in modulo exponentiation," Advances in Cryptology-Eurocrypt'92, Lect. Notes Comput. Sci., 1992.
16. J. Bos and M. Coster, "Addition chain heuristics," Advances in Cryptology, Proceedings of Crypto 89, pp.400-W7, 1989.