703358 VU Selected Chapters in Secure and Distributed Computing B: Information Hiding
summer semester 2025 | Last update: 20.02.2025 | Place course on memo listUniv.-Prof. Mag. Dr.-Ing. Rainer Böhme, MA Univ.-Prof. Mag. Dr.-Ing. Rainer Böhme, MA, +43 512 507 53202
After completing the course, students are familiar with basic methods of digital steganography and steganalysis, i.e., hiding secret messages into inconspicuous objects and detecting their presence, respectively. To do so, students use selected digital image processing methods as well as binary classifiers, especially learning-based detectors.
The lectures will cover the following topics:
- Security notions for digital media
- Digital image forensics
- Image processing
- Image compression
- Steganography by least-significant bit (LSB) replacement and LSB matching
- Analytical attacks against LSBR
- Steganography in JPEG images
- Coding for information hiding
- Adaptive steganography, criteria of adaptiveness
- Feature-based classification for steganalysis
- Steganalysis using deep learning
In the second half of the semester, students will be assigned a small programming project implementing concepts from research in steganography or steganalysis.
At the end, students will present their solution in the class.
The lecture conveys theoretical knowledge, which is then used in oral and written tasks.
The exercises involve programming tasks as well as conceptual work and on-paper calculation.
The project aimed at reproducing of existing research further deepends the understanding.
The lecture and the literature are in English.
Continuous assessment based on participation, exercise sheets, written tests, and a submitted project.
Fridrich: Steganography in Digital Media
Katzenbeisser, Petitcolas: Information Hiding. Ch 2.-3.
Prior knowledge in signal processing and cryptography is recommended.
Allocation of places in courses with a limited number of participants (PS, SE, VU, PJ)
In courses with a limited number of participants, course places are allocated as follows:
1. Students for whom the study duration would be extended due to the postponement are to be given priority.
2. If the criteria in no. 1 do not suffice, first, students for whom this course is part of a compulsory module are to be given priority, and second, students for whom this course is part of an elective module.
3. If the criteria in no. 1 and 2 do not suffice, the available places are drawn by random.
- Faculty of Teacher Education
- Faculty of Mathematics, Computer Science and Physics
- SDG 4 - Quality education: Ensure inclusive and equitable quality education and promote lifelong learning opportunities for all.
- SDG 9 - Industry, Innovation, and Infrastructure: Build resilient infrastructure, promote inclusive and sustainable industrialization, and foster innovation.
- SDG 10 - Reducing inequalities: Reduce income inequality within and among countries.
- SDG 16 - Peace, justice and strong institutions: Promote peaceful and inclusive societies for sustainable development, provide access to justice for all and build effective, accountable and inclusive institutions at all levels.
Group 0
|
||||
---|---|---|---|---|
Date | Time | Location | ||
Thu 2025-03-06
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-03-13
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-03-20
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-03-27
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-04-03
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-04-10
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-05-08
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-05-15
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-05-22
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-06-05
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-06-12
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free | |
Thu 2025-06-26
|
08.30 - 11.00 | HS 11 HS 11 | Barrier-free |
Group | Booking period | |
---|---|---|
703358-0 | 2025-02-01 08:00 - 2025-02-23 23:59 | Book course |
Benes M., Böhme R. |