Secure information hiding based on computationally intractable problems

DOI10.1080/09720529.2003.10697958zbMath1036.94010OpenAlexW2148736244MaRDI QIDQ4440673

Ioannis Kostopoulos, D. Christodulakis, Michalis Xenos, Spyridoula M. Armeni, Yannis C. Stamatiou

Publication date: 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.2003.10697958

zbMATH Keywords

cryptographysignaturesdata hiding3-coloring problemsignature graphszero knowledge interactive proof protocol

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coloring of graphs and hypergraphs (05C15) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item