Zero-knowledge authentication schemes from actions on graphs, groups, or rings

Simple item page
dc.creatorGrigoriev, Dima
dc.creatorShpilrain, Vladimir
dc.date2008-02-12
dc.date.accessioned2026-07-07T09:20:16Z
dc.date.available2026-07-07T09:20:16Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0802.1661
dc.identifierhttp://arxiv.org/abs/0802.1661
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154669
dc.subjectCryptography and Security
dc.subject94A62, 68P25
dc.titleZero-knowledge authentication schemes from actions on graphs, groups, or rings
dc.typetext

Files

Collections

arXiv