Advertisement

Algorithmic Tamper Proof (ATP) Counter Units for Authentication Devices Using PIN

  • Yuichi Komano
  • Kazuo Ohta
  • Hideyuki Miyake
  • Atsushi Shimbo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5536)

Abstract

Though Gennaro et al. discussed the algorithmic tamper proof (ATP) devices using the personal identification number (PIN) with less tamper-proof devices, and proposed counter units which count the number of wrong attempts in user authentication; however, as for the counter unit, they only constructed one which counts the total number of wrong attempts. Although large number for the limit of wrong attempts is required for usability, it allows an attacker to search PIN up to the limit and degrades the security. The construction of secure counter units which count the number of consecutive wrong attempts remains as an open problem. In this paper, we first formalize the ATP security of counter units, and propose two constructions of counter unit which count the number of consecutive wrong attempts. The security of each construction can be proven under the assumptions of secure signature scheme and random function. The former one is required to store two states in secure memory area (RP − Mem) with low computation cost; and the latter one has high computation cost but is required to store only one state in RP − Mem. This shows the trade-off between the costs of hardware and algorithm.

Keywords

algorithmic tamper proof (ATP) counter unit PIN authentication 

References

  1. 1.
    Ateniese, G., de Medeiros, B.: On the key exposure problem in chameleon hashes. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 165–179. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 37–51. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  3. 3.
    Gennaro, R., Lysyanskaya, A., Malkin, T., Micali, S., Rabin, T.: Algorithmic tamper-proof (ATP) security: Theoretical foundations for security against hardware tampering. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 258–277. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. In: 25th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1984), pp. 464–479. IEEE, Los Alamitos (1984)Google Scholar
  5. 5.
    Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme against adaptive chosen message attack. Journal of Computing (Society for Industrial and Applied Mathematics) 17(2), 281–308 (1988)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Krawczyk, H., Rabin, T.: Chameleon signatures. In: Network and Distributed System Security Symposium, NDSS 2000. The Internet Society (2000)Google Scholar
  7. 7.
    Tuyls, P., Schrijen, G.-J., Škorić, B., van Geloven, J., Verhaegh, N., Wolters, R.: Read-proof hardware from protective coatings. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 369–383. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Yuichi Komano
    • 1
  • Kazuo Ohta
    • 2
  • Hideyuki Miyake
    • 1
  • Atsushi Shimbo
    • 1
  1. 1.Toshiba CorporationKawasakiJapan
  2. 2.The University of Electro-CommunicationsTokyoJapan

Personalised recommendations