Secure information hiding based on computationally intractable problems

DOI10.1080/09720529.2003.10697958zbMATH Open1036.94010OpenAlexW2148736244MaRDI QIDQ4440673FDOQ4440673

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

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

cryptographydata hidingsignatures3-coloring problemsignature graphszero knowledge interactive proof protocol

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1953869
• A user authentication protocol based on the intractability of the 3-coloring problem
• scientific article; zbMATH DE number 1893221
• scientific article; zbMATH DE number 2217663
• Ownership proofs of digital works based on secure multiparty computation

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1953869 (Why is no real title available?)
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard

Cited in

(9)

• Ownership proofs of digital works based on secure multiparty computation
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1953869 (Why is no real title available?)
• Seeing opportunity in every difficulty: protecting information with weak value techniques
• scientific article; zbMATH DE number 1107701 (Why is no real title available?)
• A user authentication protocol based on the intractability of the 3-coloring problem
• Compositional methods for information-hiding
• Efficient information hiding based on theory of numbers
• Information hiding using matroid theory

This page was built for publication: Secure information hiding based on computationally intractable problems

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