Paper 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Full version of a paper accepted for publication in Journal of Combinatorial Theory A
Keywords
traceability codetraitor tracing
Contact author(s)
dong @ uow edu au
History
2005-06-22: received
Short URL
https://ia.cr/2005/184
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/184,
      author = {Dongvu Tonien and Reihaneh Safavi-Naini},
      title = {Recursive Constructions of Secure Codes and Hash Families Using Difference Function Families},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/184},
      year = {2005},
      url = {https://eprint.iacr.org/2005/184}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.