IMPERSONATION ATTACK ON THE STRONG IDENTIFICATION BASED ON A HARD-ON-AVERAGE PROBLEM

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

In this paper, we analyze a zero-knowledge identification scheme presented in [1], which is based on an average-case hard problem, called distributional matrix representability problem. On the contrary to the soundness property claimed in [1], we show that a simple impersonation attack is feasible.

키워드

cryptographyauthenticationzero-knowledge identification
제목
IMPERSONATION ATTACK ON THE STRONG IDENTIFICATION BASED ON A HARD-ON-AVERAGE PROBLEM
저자
Koo, BonwookKwon, DaesungLee, JooyoungSong, Jung Hwan
DOI
10.4134/BKMS.2010.47.1.063
발행일
2010-01
유형
Article
저널명
대한수학회보
47
1
페이지
63 ~ 71