RELATIONAL DATA WATERMARKING: FUNDAMENTALS
- Academic year
- 2025/2026 Syllabus of previous years
- Official course title
- RELATIONAL DATA WATERMARKING: FUNDAMENTALS
- Course code
- PHD228 (AF:588768 AR:333359)
- 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
The objectives of this course are to analyze, apply, and extend watermarking architectures for relational databases, with particular emphasis on the AHK algorithm as a foundation for developing advanced watermarking techniques. To achieve these goals, students will examine the fundamental properties and requirements of digital watermarking and explore the adversary model of this data protection approach.
Achieving these objectives enables students to design data protection solutions without restricting access to or distribution of the data, thereby significantly expanding its potential applications.
Expected learning outcomes
- Identify when it is more convenient to apply watermarking techniques to protect digital assets, rather than considering other security methods.
- Understand the advantages and risks of applying watermarking techniques for ownership protection and data tampering detection, among other applications.
- Know the particularities and convenience of applying fragile vs. robust watermarking.
- Design and implement a watermarking technique based on the watermarking trade-off management, proposing variations of the main architecture.
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 set theory, linear algebra, and mathematical logic, as basics for the design and programming of algorithms.
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. Basic watermarking architecture
3. Types of assets and carriers
4. Lab. Protection based on the type of digital asset
5. The Agrawal & Kiernan (AHK) algorithm
6. Lab. Development of a simple watermarking scheme
7. Watermark properties and requirements
8. Lab. Implementation of watermark properties
9. The adversary model
10. Lab. Basic robustness strategies
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
The exam will include both theoretical and practical questions, addressing the fundamental concepts of digital watermarking along with their requirements, characteristics, and classification criteria.
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 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 maximum score for the written exam is 25 out of 30. The remaining 5 points are awarded based on the student’s individual performance.
To encourage student participation and learning, each lesson will include examples followed by questions, with evaluation exercises conducted first collectively and then individually. This approach allows any doubts regarding the evaluation process to be clarified in advance.
In addition to the exercises reviewed in class, 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