The Experts below are selected from a list of 21165 Experts worldwide ranked by ideXlab platform
Sviatoslav Voloshynovskiy - One of the best experts on this subject based on the ideXlab platform.
-
on reversible Information Hiding system
International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
-
ISIT - On reversible Information Hiding system
2008 IEEE International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
M Haroutunian - One of the best experts on this subject based on the ideXlab platform.
-
on reversible Information Hiding system
International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
-
ISIT - On reversible Information Hiding system
2008 IEEE International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
Oleksiy Koval - One of the best experts on this subject based on the ideXlab platform.
-
on reversible Information Hiding system
International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
-
ISIT - On reversible Information Hiding system
2008 IEEE International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
Shushanik Tonoyan - One of the best experts on this subject based on the ideXlab platform.
-
on reversible Information Hiding system
International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
-
ISIT - On reversible Information Hiding system
2008 IEEE International Symposium on Information Theory, 2008Co-Authors: M Haroutunian, Shushanik Tonoyan, Oleksiy Koval, Sviatoslav VoloshynovskiyAbstract: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 Incapacity, which expresses the dependence of the Information Hiding rate on the error probability exponent E and the distortion levels for the Information hider, for the attacker and for the host data approximation. The random coding bound for reversible Information Hiding B-capacity is found. We obtain the lower bound for reversibility Information Hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.
Yang Yi-xian - One of the best experts on this subject based on the ideXlab platform.
-
Capacity Analysis of Information Hiding
Computer Engineering, 2006Co-Authors: Yang Yi-xianAbstract:This paper presents the capacity investigation result of Information Hiding comprehensively,analyzes the characteristics of various Information Hiding models,and indicates the advancing direction.It has instructional significance in the research of this field.
-
Research and implementation for speech Information Hiding
Journal of China Institute of Communications, 2002Co-Authors: Yang Yi-xianAbstract:Speech Information Hiding telephone (SITH) is a new steganography scheme based on Information Hiding security technique for Hiding one piece of speech Information data into another. It is designed for secure and covert communication when a speech is transmitted over the public switching telephone network (PSTN), which is different from secret telephone in Information encryption and Information Hiding techniques. This paper proposes the research and implementation approach for SIHT, gives out SITH module, and deals with SITH system architecture. The overall system is designed in embedding method based on DSP.
-
Design of speech Information Hiding telephone
2002 IEEE Region 10 Conference on Computers Communications Control and Power Engineering. TENCOM '02. Proceedings., 1Co-Authors: Wu Zhijun, Niu Xin-xin, Yang Yi-xianAbstract:The speech Information Hiding telephone (SITH) is a new steganography scheme based on Information Hiding security technique system The overall system is designed in embedding method using one fixed point DSP TMS320C54x and three floating DSPs TMS320C31, and a single-chip micro-controller, all DSPs working parallel in speech processing. It is designed for secure and covert communication when speech is transmitted over a public switching telephone network (PSTN).