A tight bound for frameproof codes viewed in terms of separating hash families

DOI10.1007/S10623-013-9800-0MaRDI QIDQ2249796zbMATH OpenOpenAlexFDO

Authors Tran van Trung

Publication date 3 July 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-013-9800-0

zbMATH Keywords

frameproof codeseparating hash familytight bound

Mathematics Subject Classification ID

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

Recommendations

• On tight bounds for binary frameproof codes
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Frameproof Codes
• scientific article; zbMATH DE number 1857520
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

Cites work

• A bound on the size of separating hash families
• A Generalization of a Theorem due to MacNeish
• Bounds for separating hash families
• Collusion-secure fingerprinting for digital data
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• Constructions of 2-cover-free families and related separating hash families
• Frameproof Codes
• scientific article; zbMATH DE number 1857520 (Why is no real title available?)
• scientific article; zbMATH DE number 1406785 (Why is no real title available?)
• scientific article; zbMATH DE number 1418305 (Why is no real title available?)
• Improved bounds for separating hash families
• On generalized separating hash families
• Orthogonal Arrays of Index Unity
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• The CRC handbook of combinatorial designs

Cited in

(15)

• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• New upper bounds for parent-identifying codes and traceability codes
• Improved bounds on 2-frameproof codes with length 4
• New bounds on 2-frameproof codes of length 4
• Wide-sense 2-frameproof codes
• Almost separating and almost secure frameproof codes over q-ary alphabets
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Frameproof Codes
• Asymptotic bounds on frameproof codes
• scientific article; zbMATH DE number 1857520 (Why is no real title available?)
• Improved bounds on the size of separating hash families of short length
• Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
• New upper bounds for wide-sense frameproof codes
• Constructions of \(\bar{3}\)-separable codes with length 4
• On tight bounds for binary frameproof codes

This page was built for publication: A tight bound for frameproof codes viewed in terms of separating hash families

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