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

Authors:
Dongvu Tonien;Reihaneh Safavi-Naini
Affiliations:
School of IT & CS, University of Wollongong, NSW, Australia;School of IT & CS, University of Wollongong, NSW, Australia
Venue:
Journal of Combinatorial Theory Series A
Year:
2006

Citing 3
Cited 4

New Constructions for IPP Codes

Designs, Codes and Cryptography
Tracing traitors

IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

On generalized separating hash families

Journal of Combinatorial Theory Series A
Explicit constructions for perfect hash families

Designs, Codes and Cryptography
A combinatorial approach to X-tolerant compaction circuits

IEEE Transactions on Information Theory
Generic construction of hybrid public key traitor tracing with full-public-traceability

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

Quantified Score

Hi-index	0.06

Visualization

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.