An information hiding method based on computational intractable problems

DOI10.1007/3-540-38076-0_18MaRDI QIDQ4415039zbMATH OpenFDO

Authors Spyridoula M. Armeni, Dimitris N. Christodoulakis, Ioannis Kostopoulos, Polychronis D. Kountrias, Yannis C. Stamatiou, M. Xenos

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2563/25630262.htm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computing methodologies for image processing (68U10) Computing methodologies and applications (68U99) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secure information hiding based on computationally intractable problems
• Zero-knowledge watermark detection and proof of ownership
• Ownership proofs of digital works based on secure multiparty computation
• A user authentication protocol based on the intractability of the 3-coloring problem
• scientific article; zbMATH DE number 1990814

Cited in

(6)

• Efficient information hiding based on theory of numbers
• Information hiding using matroid theory
• Compositional methods for information-hiding
• Hiding the hidden: A software system for concealing ciphertext as innocuous text
• Secure information hiding based on computationally intractable problems
• A user authentication protocol based on the intractability of the 3-coloring problem

This page was built for publication: An information hiding method based on computational intractable problems

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