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
Recommendations
cryptographydata hidingsignatures3-coloring problemsignature graphszero knowledge interactive proof protocol
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)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- A user authentication protocol based on the intractability of the 3-coloring problem
- Seeing opportunity in every difficulty: protecting information with weak value techniques
- Efficient information hiding based on theory of numbers
- Information hiding using matroid theory
- Automata, Languages and Programming
- Compositional methods for information-hiding
- Ownership proofs of digital works based on secure multiparty computation
- Title not available (Why is that?)
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)