Cryptanalysis and improvements on some graph-based authentication schemes

DOI10.1080/09720529.2013.842036MaRDI QIDQ2831095zbMATH OpenOpenAlexFDO

Authors Herish Abdullah, Mohammad Eftekhari

Publication date 2 November 2016

Published in Journal of Discrete Mathematical Sciences \& Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.6337

zbMATH Keywords

authenticationcryptanalysisNP-complete problems in graph theory

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: In 2010, Grigoriev and Shpilrain, introduced some graph-based authentication schemes. We present a cryptanalysis of some of these protocols, and introduce some new schemes to fix the problems.

Recommendations

• Authentication schemes from actions on graphs, groups, or rings
• Cryptanalysis of an authentication scheme using truncated polynomials
• Cryptanalysis of matrix conjugation schemes
• Cryptanalysis of the shifted conjugacy authentication protocol
• Authentication codes and bipartite graphs

Cites work

• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
• Authentication schemes from actions on graphs, groups, or rings
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• On the complexity of H-coloring
• PRIMES is in P
• Random Graph Isomorphism
• Zero-knowledge proofs of identity

Cited in

(12)

• scientific article; zbMATH DE number 5299614 (Why is no real title available?)
• scientific article; zbMATH DE number 1962158 (Why is no real title available?)
• The cryptography models designed by double odd labelling of trees
• scientific article; zbMATH DE number 219244 (Why is no real title available?)
• A heuristic approach towards variability of HC-128
• Topological graph passwords based on the gracefulness of disconnected graphs with circles
• Computational and Information Science
• scientific article; zbMATH DE number 7539937 (Why is no real title available?)
• Authentication schemes from actions on graphs, groups, or rings
• A signature scheme constructed from zero knowledge argument of knowledge for the subgraph isomorphism problem
• A hybrid cryptographic model: matrix transformations and caterpillar graph encryption
• Cryptanalysis of an authentication scheme using truncated polynomials

This page was built for publication: Cryptanalysis and improvements on some graph-based authentication schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2831095)