Recursive constructions of secure codes and hash families using difference function families

Authors

Joseph Tonien, University of WollongongFollow
Rei Safavi-Naini, University of WollongongFollow

RIS ID

101550

Publication Details

Tonien, D. & Safavi-Naini, R. (2006). Recursive constructions of secure codes and hash families using difference function families. Journal of Combinatorial Theory: Series A, 113 664-674.

Abstract

To protect copyrighted digital data against piracy, codes with different secure properties such as frameproof codes, secure frameproof codes, codes with identifiable parent property (IPP codes), traceability codes (TA codes) are introduced. In this paper, we study these codes together with related combinatorial objects called separating and perfect hash families.We introduce for the first time the notion of difference function families and use these difference function families to give generalized recursive techniques that can be used for any kind of secure codes and hash families. We show that some previous recursive techniques are special cases of these new techniques.