So the goal of steganography is to transmit a message from A
to B without being noticed.
So the goal of steganography is to transmit a message from A
to B.
So A is oftentimes referred to as Alice,
like in these cryptographic literature, to B, B as Bob,
without being noticed by a powerful warden.
And the name of that warden is Wendy.
So why warden?
There's this prisoners analogy, like A and B sit in a prison
cell, each every both.
And they can do in their cell what they want,
but they actually need to coordinate the prison break.
So they send messages to each other.
And between these cells, there's this Wendy.
And she's looking at everything that goes in and out.
And she's really thorough.
And she's backed by a nation state or so
with infinite resources to look through everything.
So the question is, OK, how can Alice and Bob get
some covert communication going?
Like they may exchange stuff, like magazines and so on.
That's all no problem.
But they may not exchange their flight plans.
And so how can they transmit these flight plans
within cover material?
And yeah.
What is stick analysis?
Stick analysis, that is what Wendy is doing.
So the goal of stick analysis is to tell whether a communication
process contains a concealed message.
So stick anographic message.
So if you wonder where these words come from, that's Greek.
Stick analysis is secret.
And graphene is writing.
And analysis, OK, is like this.
Analysis, OK.
So you can write this down if you like.
Stick analysis is secret or covert or hidden.
And graphene is to write.
So you can imagine it's a topic that was always interesting
to people, but particularly in a setting where there are really
powers clashing onto each other.
So for private businesses or so, it's not so much of a deal.
Because you need to have an adversary that
is powerful enough to make this problem interesting.
If you don't have a powerful adversary, it's boring.
So what can Wendy be?
Wendy can be, for example, an army besieging a city.
And you like to get messages out or so.
Presenters
Zugänglich über
Offener Zugang
Dauer
00:23:52 Min
Aufnahmedatum
2017-11-20
Hochgeladen am
2019-04-26 10:09:13
Sprache
en-US
Empfohlene Literatur
- Farid: "Photo Forensics"
-
Sencar, Memon: "Digital Image Forensics"
-
Oppenheim, Schafer: "Discrete-Time Signal Processing"
A number of scientific publications will be provided as additional reading in the course of the lecture.
ECTS-Informationen: Title: Multimedia Security
Prerequisites The majority of the methods are applications of signal processing. Thus, it is recommended to bring prior basic knowledge either in signal processing, pattern recognition, image processing, or related fields. Additionally, it is important to bring basic knowledge of C++ (nothing fancy, but "reasonable working skills")
Here are a few questions for self-assessment on the image processing part:
-
What is a Fourier transform, and why is it interesting for image processing?
-
What is the Bayes rule?
-
Write down a filter kernel for high-pass filtering of an image.
Here are a few questions for self-assessment on the C++ part:
-
What is the difference of a pointer and a reference?
-
How can I define an inherited class in C++?
-
When do I need to implement a copy constructor?
-
What are the meanings of the keyword "const"?
Contents Participants of this lecture obtain an overview of the field of Multimedia Security. This includes a variety of security-related questions around multimedia data. In particular, we present key results and techniques from image forensics, steganography, watermarking, and biometrics. Selected algorithms are implemented and tested by the participants. It is helpful to bring prior experience in signal processing or pattern recognition.
Literature
- Farid: "Photo Forensics"
-
Sencar, Memon: "Digital Image Forensics"
-
Oppenheim, Schafer: "Discrete-Time Signal Processing"
A number of scientific publications will be provided as additional reading in the course of the lecture.
Zusätzliche Informationen Schlagwörter: Steganography, Watermarking, Multimedia Forensics, Data Hiding, Copyright Protection
Erwartete Teilnehmerzahl: 20, Maximale Teilnehmerzahl: 30