Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
2000 character limit reached

Images Within Images? A Multi-image Paradigm with Novel Key-Value Graph Oriented Steganography (2304.11720v1)

Published 23 Apr 2023 in cs.MM and cs.CR

Abstract: Steganographic methods have been in the limelight of research and development for concealing secret data within a cover media without being noticed through general visualization. The Least Significant Bits (LSBs) of 8-bit color code for the RGB image arises the possibility of replacing the last two bits with the bits of the encrypted message. Several procedures have been developed to hide an image within another image however in most cases the payload image has to be within the accommodatable range of the cover image and very little literature have shown methods to hide multiple images within multiple images. This paper presents a novel approach to split the image into JSON styled dictionary of key-value pairs and using a metadata graph to locate different parts and positions of the payload images in the entire cluster of cover images. The model could be easily used in the real world scenario for privately sharing secret data over public communication channels without being noticed.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)