RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      A High-security RFID Grouping Proof Protocol

      한글로보기

      https://www.riss.kr/link?id=A100298157

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      Several categories of RFID authentication protocols have been proposed recently, among which Jules [5] introduced a novel research direction, named yoking proof. It is used to solve the problem that two tags have to be scanned simultaneously for some reasons. Afterwards, the yoking proof was developed into the grouping proof protocol and many such protocols have been presented. However there are some flaws on security or computational overhead. Based on the existing grouping proof protocols, a new method on key distribution is developed in this paper by means of distributing the points on straight lines to the entities. With this method, the performance of the grouping proof protocol will be improved. In comparison with the previous protocols, it provides security enhancement and performance improvement, which balances security and computational overhead to some extent.
      번역하기

      Several categories of RFID authentication protocols have been proposed recently, among which Jules [5] introduced a novel research direction, named yoking proof. It is used to solve the problem that two tags have to be scanned simultaneously for some ...

      Several categories of RFID authentication protocols have been proposed recently, among which Jules [5] introduced a novel research direction, named yoking proof. It is used to solve the problem that two tags have to be scanned simultaneously for some reasons. Afterwards, the yoking proof was developed into the grouping proof protocol and many such protocols have been presented. However there are some flaws on security or computational overhead. Based on the existing grouping proof protocols, a new method on key distribution is developed in this paper by means of distributing the points on straight lines to the entities. With this method, the performance of the grouping proof protocol will be improved. In comparison with the previous protocols, it provides security enhancement and performance improvement, which balances security and computational overhead to some extent.

      더보기

      목차 (Table of Contents)

      • Abstract
      • 1. Introduction
      • 2. Design of the High Security RFID Grouping Proof Protocol
      • 2.1. Basis
      • 2.2. Protocol Design
      • Abstract
      • 1. Introduction
      • 2. Design of the High Security RFID Grouping Proof Protocol
      • 2.1. Basis
      • 2.2. Protocol Design
      • 3. Analysis on the Performance of the Protocol
      • 3.1. Analysis on Performance
      • 3.2. Analysis on Security
      • 4. Conclusion
      • Acknowledgements
      • References
      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼