Web search steganalysis: some challenges and approaches

R. Chandramouli · 2004

This work presents some important issues in searching the Internet for covert messages. Several related theoretical and practical problems are discussed. Web search is formulated as a mathematical optimization problem and solutions are proposed. Two algorithms: coordinated search and random search are discussed within this optimization framework along with their pros and cons.

Read the paper · More papers on PaperTik