Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 63-71 |
| Number of pages | 9 |
| Journal | Bulletin of the Korean Mathematical Society |
| Volume | 47 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2010 |
Keywords
- Authentication
- Cryptography
- Zero-knowledge identification