Cryptology ePrint Archive: Report 2005/184

Recursive Constructions of Secure Codes and Hash Families Using Difference Function Families

Dongvu Tonien and Reihaneh Safavi-Naini

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.

Category / Keywords: foundations / traceability code, traitor tracing

Publication Info: Full version of a paper accepted for publication in Journal of Combinatorial Theory A

Date: received 16 Jun 2005

Contact author: dong at uow edu au

Available format(s): PDF | BibTeX Citation

Version: 20050622:215059 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]