Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Batch Verification with DSA-Type Digital Signatures for Ubiquitous Computing

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Included in the following conference series:

  • 1257 Accesses

Abstract

We propose a new method for verifying bad signature in a batch instance of DSA-type digital signatures when there is one bad signature in the batch. The proposed method can verify and identify a bad signature using two modular exponentiations and \(n + 3\sqrt{n}/2\) modular multiplications where n is the number of signatures in the batch instance. Simulation results show our method reduces considerably the number of modular multiplications compared with the existing methods.

The present research was conducted by the research fund of Dankook University in 2003.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Pastuszak, J., Michalek, D., Pieprzyk, J., Seberry, J.: Identification of bad signatures in batches. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Coron, J.-S., Naccache, D.: On the security of rsa screening. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 197–203. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Berlekamp, E.: Algebraic Coding Theory. McGraw-Hill, New York (1968)

    MATH  Google Scholar 

  4. Harn, L.: Batch verifying multiple dsa-type digital signatures. In: Electronics Letters, pp. 870–871 (1998)

    Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Teske, E.: Computing discrete logarithms with the parallelized kangaroo method. Discrete Applied Mathematics 130, 61–82 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Buchmann, J., Jacobson, M., Teske, E.: On some computational problems in finite abelian groups. Mathematics of Computation 66, 1663–1687 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bellare, M., Garay, J.A., Rabin, T.: Batch verification with applications to cryptography and checking. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, p. 170. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, Seoul, 151-742, Korea

    Seungwon Lee & Yookun Cho

  2. Division of Information and Computer Science, Dankook University, Seoul, 140-714, Korea

    Seongje Cho & Jongmoo Choi

Authors
  1. Seungwon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seongje Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jongmoo Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yookun Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yu-Ping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security(Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, S., Cho, S., Choi, J., Cho, Y. (2005). Batch Verification with DSA-Type Digital Signatures for Ubiquitous Computing. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_18

Download citation

  • DOI: https://doi.org/10.1007/11596981_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation