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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 500
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKoo, Bonwookko
dc.contributor.authorKwon, Daesungko
dc.contributor.authorLee, Jooyoungko
dc.contributor.authorSong, Jung Hwanko
dc.date.accessioned2016-09-07T01:10:04Z-
dc.date.available2016-09-07T01:10:04Z-
dc.date.created2016-08-09-
dc.date.created2016-08-09-
dc.date.created2016-08-09-
dc.date.issued2010-01-
dc.identifier.citationBULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, v.47, no.1, pp.63 - 71-
dc.identifier.issn1015-8634-
dc.identifier.urihttp://hdl.handle.net/10203/212516-
dc.description.abstractIn 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.-
dc.languageEnglish-
dc.publisherKOREAN MATHEMATICAL SOC-
dc.titleIMPERSONATION ATTACK ON THE STRONG IDENTIFICATION BASED ON A HARD-ON-AVERAGE PROBLEM-
dc.typeArticle-
dc.identifier.wosid000274756700006-
dc.identifier.scopusid2-s2.0-77749319302-
dc.type.rimsART-
dc.citation.volume47-
dc.citation.issue1-
dc.citation.beginningpage63-
dc.citation.endingpage71-
dc.citation.publicationnameBULLETIN OF THE KOREAN MATHEMATICAL SOCIETY-
dc.identifier.doi10.4134/BKMS.2010.47.1.063-
dc.contributor.localauthorLee, Jooyoung-
dc.contributor.nonIdAuthorKoo, Bonwook-
dc.contributor.nonIdAuthorKwon, Daesung-
dc.contributor.nonIdAuthorSong, Jung Hwan-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorcryptography-
dc.subject.keywordAuthorauthentication-
dc.subject.keywordAuthorzero-knowledge identification-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0