International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Dongvu Tonien
Reihaneh Safavi-Naini
Download:
URL: http://eprint.iacr.org/2005/184
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12520,
  title={Recursive Constructions of Secure Codes and Hash Families Using Difference Function Families},
  booktitle={IACR Eprint archive},
  keywords={foundations / traceability code, traitor tracing},
  url={http://eprint.iacr.org/2005/184},
  note={Full version of a paper accepted for publication in Journal of Combinatorial Theory A dong@uow.edu.au 12951 received 16 Jun 2005},
  author={Dongvu Tonien and Reihaneh Safavi-Naini},
  year=2005
}