Object

Title: Random coding bound of reversible information hiding E-capacity

Journal or Publication Title:

Математические вопросы кибернетики и вычислительной техники=Կիբեռնետիկայի և հաշվողական տեխնիկայի մաթեմատիկական հարցեր=Mathematical problems of computer science

Date of publication:

2007

Volume:

28

ISSN:

0131-4645

Additional Information:

click here to follow the link

Other title:

Տեղեկություններ թաքցնող շրջելի համակարգի Е-ունակության պատահական կոդավորման գնահատականը

Coverage:

18-33

Abstract:

In this paper we consider the problem of reversible information hiding in the case when the attacker uses only discrete memoryless channels (DMC), the decoder knows only the class of channels, but not the DMC chosen by the attacker, the attacker knows the information-hiding strategy, probability distributions of all random variables, but not the side information. We introduce the notion of reversible information hiding E-capacity, which expresses the dependence of the information hiding rate on the error probability exponent and the distortion levels for information hider, for attacker and for the host data approximation. The random coding bound for reversible information hiding E-capacity is found. When E ! 0 we obtain the lower bound for reversibility information hiding capacity. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.

Publisher:

Изд-во НАН РА

Date created:

2007-02-10

Format:

pdf

Identifier:

oai:arar.sci.am:258513

Location of original object:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Object collections:

Last modified:

Dec 8, 2023

In our library since:

Jul 24, 2020

Number of object content hits:

10

All available object's versions:

https://arar.sci.am/publication/281589

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

Objects

Similar

This page uses 'cookies'. More information