A user authentication protocol based on the intractability of the 3-coloring problem

DOI10.1080/09720529.2002.10697934zbMath1013.94020OpenAlexW1983144008MaRDI QIDQ4792932

Ira N. Antonopoulou

Publication date: 17 February 2003

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2002.10697934

zbMATH Keywords

authenticationzero knowledge3-coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Unnamed Item
• Unnamed Item

This page was built for publication: A user authentication protocol based on the intractability of the 3-coloring problem