The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

A Anonymous Authorization Scheme Based on ECC for RFID Privacy

RFID 프라이버시를 위한 ECC기반의 익명인증기법

  • 김석매 (충북대학교 전자계산학과 알고리즘 연구실) ;
  • 이영진 (중국연변대학교 컴퓨터과학 및 기술학과) ;
  • 이상호 (충북대학교 전기전자컴퓨터공학부) ;
  • 이충세 (충북대학교 전기전자컴퓨터공학부)
  • Published : 2008.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, with the development of mobile techniques and the consideration to conveniency of using, the research on Mobile RFID Reader technique is getting more and more attentions. Until now, all security authentication algorithms of RFID are algorithms about range between Tag and Reader. The range between Reader and backend DB is composed by wired networks, so it's supposed to be secure range. But it must be taken account of the problem of information security and privacy in wireless range during the design of Mobile RFID Reader. In this paper we design an blind signature scheme based on weil-paring finite group's ECC encryption scheme, and by using this blind signature we propose the anonymous authorization scheme to Mobile RFID Reader's users.

최근 이동통신기술의 발달과 사용편리성을 위한 최근에 모바일 RFID리더기애 대한 연구 개발도 활발하게 진행되고 있다. 특히 현재 RFID 시스템에서는 리더와 백-엔드 DB 구간은 유선구간으로 간주하여 안전한 채널로 가정하고 있다. 그러나 모바일 RFID 리더기 사용으로 시스템에는 무선 환경의 보안 취약성과 프라이버시 침해 등 문제점이 발생하고 있다. 이 논문에서는 초특이 타원 곡선 Weil-pairing 유한군을 적용한 타원 곡선 암호 알고리즘을 사용하여 은닉서명을 설계하고 그 은닉서명을 기반으로 사용자 익명성이 보장되는 모바일 RFID리더 인증 기법을 제안한다.

Keywords

References

  1. Yong-Zhen Li, Young-Bok Cho, Nam-Kyoung Um, and Sang-Ho Lee, 'Security and Privacy on Authentication Protocol for Low-Cost RFID,' Proceeding of the 2006 International Conference on Computational Intelligence and Security(CIS06), Part 2, pp. 1101-1104, Nov. 2006
  2. A. Juels 'RFID Security and Privacy: A Research Survey,' In IEEE Journal on Selected Areas in Communications, Vol. 24, No. 2, 2006, pp. 381-394 https://doi.org/10.1109/JSAC.2005.861395
  3. D. L. Chaum, 'Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,' Communications of the ACM, vol. 24, no. 2, 1981, pp.84-88 https://doi.org/10.1145/358549.358563
  4. A. Serjantov, P. Sewell1 'Passive-attack analysis for connection-based anonymity systems,' In International Journal of Information Security, Vol. 4, Num. 3, 2005, pp.172-180 https://doi.org/10.1007/s10207-004-0059-3
  5. D. L. Chaum, V. Heyst, 'Group Signature,' Advances in Cryptology-Eurocrypt 1991, LNCS 547, pp.257-265
  6. D. Boneh, X. Boyen and H. Shacham, 'Short group signatures,' Advances in Cryptology- Crypto 2004, LNCS 3152, pp.41-55
  7. D. Boneh and X. Boyen, 'Short signatures without random oracles,' Advances in Cryptology-Eurocrypt 2004, LNCS 3027, pp.56-73
  8. R. L. Rivest. 'Chaffing and Winnowing: Confidentiality without Encryption,' CryptoBytes 4(1), RSA Laboratories, 1998, pp.12-17
  9. R. L. Rivest, A. Shamir, Y. Tauman 'How to Leak a Secret,' Asia-CRYPT 2001, LNCS 2248, pp.552-565
  10. S. Brands, 'Untraceable Off-line Cash in Wallets with Observers,' CRYPTO'93, LNCS 773, pp.302-318
  11. M. Bellare, C. Namprempre, D. Pointcheval, M. Semanko, 'The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme,' Journal of Cryptology, June 2003, pp.185-215
  12. D. L. Chaum, 'Security Without Identification: Transaction Systems to Make Big Brother Obsolete,' Commun. ACM, 1985, pp.1030-1044
  13. J. Camenisch, A. Lysyanskaya, 'Signature Schemes and Anonymous Credentials from Bilinear Map,' CRYPTO 2004, LNCS 3152, pp.56-72
  14. A. Shamir, 'How to Share a Secret,' Commun. ACM, 22, 1979, pp.612-613 https://doi.org/10.1145/359168.359176