RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      KCI등재

      ON EFFICIENT TWO-FLOW ZERO-KNOWLEDGE IDENTIFICATION AND SIGNATURE

      한글로보기

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

      • 0

        상세조회
      • 0

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

      부가정보

      다국어 초록 (Multilingual Abstract)

      In this paper, we propose an effcient two-flow zero-knowledge blind identification protocol on the elliptic curve cryptographic (ECC) system. A. Saxena et al. first proposed a two-flow blind identification protocol in 2005. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. But our protocol is secure under such attacks because of using the hash function. In particular, it is fast because we don't use the pairing operation and consists of only two message flows. It does not rely on any underlying signature or encryption scheme. Our protocol is secure assuming the hardness of the Discrete-Logarithm Problem in bilinear groups.
      번역하기

      In this paper, we propose an effcient two-flow zero-knowledge blind identification protocol on the elliptic curve cryptographic (ECC) system. A. Saxena et al. first proposed a two-flow blind identification protocol in 2005. But it has a weakness of th...

      In this paper, we propose an effcient two-flow zero-knowledge blind identification protocol on the elliptic curve cryptographic (ECC) system. A. Saxena et al. first proposed a two-flow blind identification protocol in 2005. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. But our protocol is secure under such attacks because of using the hash function. In particular, it is fast because we don't use the pairing operation and consists of only two message flows. It does not rely on any underlying signature or encryption scheme. Our protocol is secure assuming the hardness of the Discrete-Logarithm Problem in bilinear groups.

      더보기

      참고문헌 (Reference)

      1 A. Saxena, "Zero-Knowledge blind identification for smart cards using bilinear pairings" Cryptology e-Print Archive 2005

      2 U. Feige, "Zero knowledge proofs of identity" 1 : 77-94, 1988

      3 D. Boneh, "Short signatures from the Weil pairing" Springer-Verlag 514-532, 2001

      4 Byung Mun Choi, "Secure identification and signature using zero-knowledge proofs and bilinear pairings" 충청수학회 21 (21): 403-411, 2008

      5 O. Goldreich, "Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems" 38 (38): 690-728, 1991

      6 M. Bellare, "On defining proofs of knowledge" 740 : 390-420, 1993

      7 Y. W. Lee, "Intelligent ID-based threshold systems by an encryption and decryption from bilinear pairing, Lecture Notes in Artificial Intelligence" 1022-1028, 2005

      8 D. Boneh, "Identity-based encryption from the Weil pairing" Springer-Verlag 213-229, 2001

      9 A. Fiat, "How to prove yourself: practical solutions to identification and sig-nature problems, Advances in Cryptology" 263 : 186-194, 1987

      10 M. Bellare, "Entity authentication and key distribution" 773 : 232-249, 1994

      1 A. Saxena, "Zero-Knowledge blind identification for smart cards using bilinear pairings" Cryptology e-Print Archive 2005

      2 U. Feige, "Zero knowledge proofs of identity" 1 : 77-94, 1988

      3 D. Boneh, "Short signatures from the Weil pairing" Springer-Verlag 514-532, 2001

      4 Byung Mun Choi, "Secure identification and signature using zero-knowledge proofs and bilinear pairings" 충청수학회 21 (21): 403-411, 2008

      5 O. Goldreich, "Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems" 38 (38): 690-728, 1991

      6 M. Bellare, "On defining proofs of knowledge" 740 : 390-420, 1993

      7 Y. W. Lee, "Intelligent ID-based threshold systems by an encryption and decryption from bilinear pairing, Lecture Notes in Artificial Intelligence" 1022-1028, 2005

      8 D. Boneh, "Identity-based encryption from the Weil pairing" Springer-Verlag 213-229, 2001

      9 A. Fiat, "How to prove yourself: practical solutions to identification and sig-nature problems, Advances in Cryptology" 263 : 186-194, 1987

      10 M. Bellare, "Entity authentication and key distribution" 773 : 232-249, 1994

      11 W. Diffie, "Authentication and Authenticated key ex-changes Designs" 2 : 107-125, 1992

      12 D.R. Stinson, "An efficient and secure two-flow zero-knowledge identification protocol" Cryptology e-Print Archive 2006

      더보기

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

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

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

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2026 평가예정 재인증평가 신청대상 (재인증)
      2020-01-01 평가 등재학술지 유지 (재인증) KCI등재
      2019-11-08 학회명변경 영문명 : The Korean Society For Computational & Applied Mathematics And Korean Sigcam -> Korean Society for Computational and Applied Mathematics KCI등재
      2017-01-01 평가 등재학술지 유지 (계속평가) KCI등재
      2013-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2010-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2008-02-18 학술지명변경 한글명 : Journal of Applied Mathematics and Infomatics(Former: Korean J. of Comput. and Appl. Math.) -> Journal of Applied Mathematics and Informatics
      외국어명 : Journal of Applied Mathematics and Infomatics(Former: Korean J. of Comput. and Appl. Math.) -> Journal of Applied Mathematics and Informatics
      KCI등재
      2008-02-15 학술지명변경 한글명 : Journal of Applied Mathematics and Computing(Former: Korean J. of Comput. and Appl. Math.) -> Journal of Applied Mathematics and Infomatics(Former: Korean J. of Comput. and Appl. Math.)
      외국어명 : Journal of Applied Mathematics and Computing(Former: Korean J. of Comput. and Appl. Math.) -> Journal of Applied Mathematics and Infomatics(Former: Korean J. of Comput. and Appl. Math.)
      KCI등재
      2008-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2006-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2004-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2001-01-01 평가 등재학술지 선정 (등재후보2차) KCI등재
      1998-07-01 평가 등재후보학술지 선정 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.16 0.16 0.13
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.1 0.07 0.312 0.02
      더보기

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

      나만을 위한 추천자료

      해외이동버튼