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

DOI10.1016/j.jcta.2005.07.001zbMath1140.94014OpenAlexW1994662217MaRDI QIDQ2490863

Dongvu Tonien, Reihaneh Safavi-Naini

Publication date: 18 May 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.07.001

zbMATH Keywords

secure frameproof codesidentifiable parent propertytraitor tracingrecursiveframeproof codestraceability codesseparating hash familiesperfect hash familiesdifference function families

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES ⋮ White box traitor tracing ⋮ Perfect Hash Families: Constructions and Existence ⋮ On generalized separating hash families ⋮ Recursive constructions of secure codes and hash families using difference function families. ⋮ Explicit constructions for perfect hash families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• New constructions for IPP codes
• Recursive constructions of secure codes and hash families using difference function families.
• Combinatorial properties of frameproof and traceability codes
• Tracing traitors
• Collusion-secure fingerprinting for digital data
• Dynamic traitor tracing

This page was built for publication: Recursive constructions of secure codes and hash families using difference function families.