Zero-knowledge authentication schemes from actions on graphs, groups, or rings
Cryptography and Security
2008-02-13 v1
Abstract
We propose a general way of constructing zero-knowledge authentication schemes from actions of a semigroup on a set, without exploiting any specific algebraic properties of the set acted upon. Then we give several concrete realizations of this general idea, and in particular, we describe several zero-knowledge authentication schemes where forgery (a.k.a. impersonation) is NP-hard. Computationally hard problems that can be employed in these realizations include (Sub)graph Isomorphism, Graph Colorability, Diophantine Problem, and many others.
Cite
@article{arxiv.0802.1661,
title = {Zero-knowledge authentication schemes from actions on graphs, groups, or rings},
author = {Dima Grigoriev and Vladimir Shpilrain},
journal= {arXiv preprint arXiv:0802.1661},
year = {2008}
}