Frameproof and IPP codes

DOI10.1007/3-540-45311-3_12MaRDI QIDQ4788569zbMATH OpenFDO

Authors Palash Sarkar, D. R. Stinson

Publication date 19 May 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45311-3_12

zbMATH Keywords

error-correcting codesframeproof codehash familiesidentifying parent property codes

Mathematics Subject Classification ID

Cryptography (94A60) Other types of codes (94B60)

Recommendations

• A tight bound for frameproof codes viewed in terms of separating hash families
• Frameproof Codes
• New constructions for IPP codes
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Recursive constructions of secure codes and hash families using difference function families.

Cited in

(12)

• Linear hash families and forbidden configurations
• New constructions for IPP codes
• A tight bound for frameproof codes viewed in terms of separating hash families
• On generalized separating hash families
• Traitors Collaborating in Public: Pirates 2.0
• Asymptotic bounds on frameproof codes
• Secure Frameproof Code Through Biclique Cover
• Detecting arrays for effects of single factors
• Detecting arrays for effects of multiple interacting factors
• Constructions and bounds for separating hash families
• Explicit constructions of separating hash families from algebraic curves over finite fields
• On tight bounds for binary frameproof codes

This page was built for publication: Frameproof and IPP codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4788569)