Zero-knowledge authentication schemes from actions on graphs, groups, or rings - Université de Rennes Accéder directement au contenu
Article Dans Une Revue Annals of Pure and Applied Logic Année : 2010

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

Résumé

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.
Fichier principal
Vignette du fichier
oneway_np.pdf (129.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00252139 , version 1 (12-02-2008)

Identifiants

Citer

Dima Grigoriev, Vladimir Shpilrain. Zero-knowledge authentication schemes from actions on graphs, groups, or rings. Annals of Pure and Applied Logic, 2010, 162 (3), pp.194-200. ⟨10.1016/j.apal.2010.09.004⟩. ⟨hal-00252139⟩
352 Consultations
89 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More