Authentication schemes from actions on graphs, groups, or rings

DOI10.1016/j.apal.2010.09.004zbMath1236.94076OpenAlexW1501881162MaRDI QIDQ638486

Vladimir Shpilrain, Dima Yu. Grigoriev

Publication date: 12 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.09.004

zbMATH Keywords

NP-hardnessone-way functionauthentication

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Algorithmic problems in right-angled Artin groups: complexity and applications ⋮ Authenticated commutator key agreement protocol ⋮ The status of polycyclic group-based cryptography: a survey and open problems ⋮ Cryptographic group actions and applications ⋮ Cryptanalysis and improvements on some graph-based authentication schemes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group-based cryptography
• Zero-knowledge proofs of identity
• Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
• Complexity of wild matrix problems and of isomorphism of algebras and graphs
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Equations in free metabelian groups

This page was built for publication: Authentication schemes from actions on graphs, groups, or rings