Authentication schemes from actions on graphs, groups, or rings
DOI10.1016/J.APAL.2010.09.004zbMATH Open1236.94076OpenAlexW1501881162MaRDI QIDQ638486FDOQ638486
Authors: Vladimir Shpilrain, Dima 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
Recommendations
- Cryptanalysis and improvements on some graph-based authentication schemes
- Authenticating computation on groups: new homomorphic primitives and applications
- scientific article; zbMATH DE number 874210
- Authentication codes and bipartite graphs
- The Combinatorics of Perfect Authentication Schemes
- On the fly authentication and signature schemes based on groups of unknown order
- Authenticated group key agreement protocol based on twist conjugacy problem in near-rings
- Using classical groups to construct authentication codes
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
- Title not available (Why is that?)
- Equations in free metabelian groups
- Zero-knowledge proofs of identity
- Group-based cryptography
- Complexity of wild matrix problems and of isomorphism of algebras and graphs
- Title not available (Why is that?)
Cited In (11)
- A user authentication protocol based on the intractability of the 3-coloring problem
- Diophantine cryptography over infinite groups
- Cryptanalysis and improvements on some graph-based authentication schemes
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- Algorithmic problems in right-angled Artin groups: complexity and applications
- Non-interactive commitment from non-transitive group actions
- Authenticated commutator key agreement protocol
- The status of polycyclic group-based cryptography: a survey and open problems
- Cryptographic group actions and applications
- Title not available (Why is that?)
- Authentication from matrix conjugation
This page was built for publication: Authentication schemes from actions on graphs, groups, or rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638486)
