Authentication schemes from actions on graphs, groups, or rings
From MaRDI portal
Publication:638486
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
Cites work
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 1796970 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- Complexity of wild matrix problems and of isomorphism of algebras and graphs
- Equations in free metabelian groups
- Foundations of Cryptography
- Group-based cryptography
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
- Zero-knowledge proofs of identity
Cited in
(11)- scientific article; zbMATH DE number 7310111 (Why is no real title available?)
- Algorithmic problems in right-angled Artin groups: complexity and applications
- Authentication from matrix conjugation
- Diophantine cryptography over infinite groups
- Cryptanalysis and improvements on some graph-based authentication schemes
- Cryptographic group actions and applications
- Non-interactive commitment from non-transitive group actions
- A user authentication protocol based on the intractability of the 3-coloring problem
- Authenticated commutator key agreement protocol
- The status of polycyclic group-based cryptography: a survey and open problems
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
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)