A Local Optimum Matrix Construction for Matrix Embedding Steganography

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Masjedi Peyman; TAHERI MOHAMMAD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2020 | Issue:6

Download Full-Text

View:

Download:

Information Seminar Paper

Title

A Local Optimum Matrix Construction for Matrix Embedding Steganography

Author(s)

Masjedi Peyman | TAHERI MOHAMMAD

Keywords

Steganography

Matrix Embedding

Parity Check Matrix

Hill Climbing

Abstract

Steganography is the task of embedding a secret message in a cover media (e. g. image, video and voice) such that the stego media is not intuitively separable from the original ones. It is one of the interesting fields of security especially in transferring digital media as the major components of the web sites, emails and any web-based communications. Matrix Embedding is a general approach used in many Steganography schemes, especially where the cover size is small e. g. Voice Over IP (VOIP) packets. In this approach, the message is mapped to a series of bits (stego) to replace the same number of low significant bits in the cover. The embedding matrix is used for extracting the message by a linear combination of the stego bits. For a given matrix and secret message, there are specific series of stego-bits from which the message can be extracted. Embedding is done by an inverse problem to minimize a cost as the difference between the stego and the original bits. Hence, each message has a specific embedding cost based on the matrix. In this paper, a method is proposed to find an embedding matrix which minimizes the expectation of embedding cost for a uniform distribution of messages. To that end; a dynamic programming algorithm is proposed to efficiently find the expected cost for a given matrix. By use of this algorithm, any search method may be used to solve the problem. In this paper, a fast Hill-climbing search strategy is designed to find a local optimum matrix in an allowable time.

Video

Cites

No record.

References

No record.

Cite

APA: Copy

Masjedi, Peyman, & TAHERI, MOHAMMAD. (2020). A Local Optimum Matrix Construction for Matrix Embedding Steganography. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949224/en

Vancouver: Copy

Masjedi Peyman, TAHERI MOHAMMAD. A Local Optimum Matrix Construction for Matrix Embedding Steganography. 2020. Available from: https://sid.ir/paper/949224/en

IEEE: Copy

Peyman Masjedi, and MOHAMMAD TAHERI, “A Local Optimum Matrix Construction for Matrix Embedding Steganography,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2020, [Online]. Available: https://sid.ir/paper/949224/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops