RELATIONAL DATA WATERMARKING: ROBUST SCHEMES
- Academic year
- 2025/2026 Syllabus of previous years
- Official course title
- RELATIONAL DATA WATERMARKING: ROBUST SCHEMES
- Course code
- PHD228 (AF:588769 AR:333361)
- Teaching language
- English
- Modality
- On campus classes
- ECTS credits
- 2 out of 4 of RELATIONAL DATA WATERMARKING
- Degree level
- Corso di Dottorato (D.M.226/2021)
- Academic Discipline
- INF/01
- Period
- Annual
- Course year
- 1
- Where
- VENEZIA
- Moodle
- Go to Moodle page
Contribution of the course to the overall degree programme goals
It equips students with both theoretical and practical foundations in information hiding techniques, focusing specifically on digital watermarking for relational databases.
The course primarily addresses robust schemes designed to ensure ownership protection and enable copy tracing. Its objectives are to analyze, apply, and extend robust watermarking techniques for relational databases, with particular attention to adversary models.
Emphasis is placed on classifying schemes in terms of robustness versus fragility, and on examining the different types of attacks that may compromise watermark synchronization.
By meeting these objectives, students will be able to design data protection solutions that safeguard access and distribution rights, thereby broadening the potential applications of digital data.
Expected learning outcomes
- Identify how security and robustness differ and how they can be combined independently, with or without affecting data quality.
- Identify threats at different levels that may compromise the preservation of the watermark.
- Design and implement advanced watermark-based protection strategies that will boost watermark preservation, contributing not only to robustness but also to security.
Pre-requirements
- The capacity to understand (read and listen) the content presented in English and the ability to communicate (write and speak) using this language.
- To know the basics of digital watermarking and relational data watermarking.
Note: Although a basic understanding of relational database theory is desirable, this is not mandatory for students, considering a brief introduction to this topic is included in the course.
Contents
2. Robust and fragile techniques
3. Side-effects of relational data protection
4. Lab. Implementing basic watermark detectability rules
5. Virtual Primary Key (VPK) based synchronization
6. Lab. Implementation and evaluation of VPK schemes
7. First-degree attacks
8. Lab. Facing first-degree attacks (pseudo-random selection and majority voting)
9. Second-degree attacks (robustness vs. security)
10. Lab. Facing second-degree attacks (false ownership claims, collusion, & brute force attacks).
Referral texts
- Halder, R., Pal, S., & Cortesi, A. (2010). Watermarking techniques for relational databases: Survey, classification and comparison. Journal of universal computer science, 16(21), 3164-3190.
- Rani, S., & Halder, R. (2022). Comparative analysis of relational database watermarking techniques: An empirical study. IEEE Access, 10, 27970-27989.
- Cox, I., Miller, M., Bloom, J., Fridrich, J., and Kalker, I., Digital Watermarking and Steganography. Morgan kaufmann, 2007.
- Barni, M. and Bartolini, F., 2004. Watermarking systems engineering: enabling digital assets security and other applications. Crc Press.
Assessment methods
During the exam, the use of printed materials (such as books, articles, or class notes) is not permitted. The use of cell phones or other electronic devices, including tablets and laptops, is also strictly prohibited.
In addition to the written exam, students will be evaluated on their performance in labs and lessons. This performance will serve as an individual criterion considered in the professor’s final assessment. Thus, while the written exam constitutes the main evaluation, student performance throughout the course also contributes to the overall assessment, which, together with the exam, determines the final grade.
The written exam carries a maximum of 25 points out of 30. The remaining 5 points are awarded on the basis of individual performance throughout the course.
To encourage participation and support learning, each lesson includes examples followed by questions, with exercises first completed collectively and then individually. This approach ensures that any uncertainties regarding the evaluation process are clarified in advance. In addition, students have access to supplementary materials on the university’s e-learning platform (moodle.unive.it).
Type of exam
Grading scale
A. Scores in the 18–22 range will be awarded when the student demonstrates sufficient knowledge of the content delivered in class and an adequate ability to analyze and investigate watermarking methods for relational databases.
B. Scores in the 23–26 range will be awarded in the presence of a fair knowledge of the content taught in class, as well as a satisfactory performance in the analysis and investigation of watermarking methods for relational databases, and the ability to consider solutions related to other disciplines or security methods.
C. Scores in the 27–30 range will be awarded in the presence of good or excellent knowledge of the content offered in the lessons and strong analytical and investigative skills regarding the security concepts and methods presented in the cases. At this level, the student must demonstrate greater independence in conducting research, as well as a high ability to analyze and integrate watermarking methods with other solutions or disciplines.
D. “Cum laude” will be awarded in the presence of excellent knowledge of the content and outstanding performance in participation and implementation of solutions discussed in class.
Teaching methods
2030 Agenda for Sustainable Development Goals
This subject deals with topics related to the macro-area "Cities, infrastructure and social capital" and contributes to the achievement of one or more goals of U. N. Agenda for Sustainable Development