Binary Data-Hiding Game
|Event Date:||October 20, 2008|
|Speaker:||K.P. (Suba) Subbalakshmi|
|Speaker Affiliation:||Stevens Institute of Technology|
|Sponsor:||CNSIP Area Seminar|
|Contact Name:||Prof Jan Allebach
|Contact Phone:||(765) 494-3535
|Open To:||Acceptable for ECE694A
Data-hiding deals with hiding one type of medium in another, imperceptibly,- for various applications. For example, a paragraph of text can be hidden in an image to enable covert communication between the sender and the intended recipient. Often there is a third party involved: the attacker, whose intensions are to disrupt this covert communication.
In this talk we will formulate the digital, binary data-hiding problem as a game between the embedder and the attacker. The aim of the embedder is to minimize the errors in the received message for the intended recipient, while the aim of the attacker is to maximize the probability of errors for the intended recipient, while keeping the attack power below a certain level.
We outline the proof of the fact that the worst case additive attack is a 3-δ function. Then we discuss the solution of the game and show that the game has a Nash equilibrium for certain embedding message to noise ratios while this is not true for other message to noise ratio.
Suba is an Associate Professor at the Dept. of E.C.E, Stevens Institute of Technology. Her areas of research include: information security, cognitive radio network security and Internet forensics. Her research is sponsored by National Science Foundation, Intelligence Systems Support Office, US Army and other agencies. Suba is the Chair of the Security Special Interest Group of the IEEE ComSoc, Multimedia Technical Committee. She is also an Associate Editor of the SPIE Journal of Electronic Imaging and a Guest Editor of EURASIP Journal on Advances in Signal Processing, Special Issue on Dyanmic Spectrum Access for Wireless Networks. Suba also co-founded and is a Co-CTO of an interactive media company: InSteam Media LLC.