On tight bounds for binary frameproof codes

DOI10.1007/S10623-015-0037-YMaRDI QIDQ887414zbMATH OpenOpenAlexFDO

Authors Chuan Guo, Tran van Trung, D. R. Stinson

Publication date 26 October 2015

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

Full work available at URL https://arxiv.org/abs/1406.6920

zbMATH Keywords

codeframeproof codeseparating hash familyhash family

Mathematics Subject Classification ID

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

Abstract: In this paper, we study $w$-frameproof codes, which are equivalent to $1,w$-separating hash families. Our main results concern binary codes, which are defined over an alphabet of two symbols. For all $wgeq3$, and for $w+1leqNleq3w$, we show that an $SHF(N;n,2,1,w)$ exists only if $nleqN$, and an $SHF(N;N,2,1,w)$ must be a permutation matrix of degree $N$.

Recommendations

• A tight bound for frameproof codes viewed in terms of separating hash families
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Publication:4788569
• Frameproof Codes
• Improved bounds for separating hash families

Cites work

• 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?)
• A tight bound for frameproof codes viewed in terms of separating hash families
• 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
• Frameproof Codes
• New Bounds for Frameproof Codes
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

Cited in

(15)

• On symmetric designs and binary 3-frameproof codes
• Comments on "New results on frame-proof codes and traceability schemes
• Improved Constructions of Frameproof Codes
• Some intriguing upper bounds for separating hash families
• Secure Frameproof Code Through Biclique Cover
• Wide-sense 2-frameproof codes
• Constructions of almost secure frameproof codes with applications to fingerprinting schemes
• A tight bound for frameproof codes viewed in terms of separating hash families
• Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
• Constructions and bounds for separating hash families
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Improved bounds on 2-frameproof codes with length 4
• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets

This page was built for publication: On tight bounds for binary frameproof codes

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