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

DOI10.1007/S10623-013-9800-0zbMATH Open1321.94142OpenAlexW1998969622MaRDI QIDQ2249796FDOQ2249796

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

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

zbMATH Keywords

frameproof codeseparating hash familytight bound

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Wide-sense 2-frameproof codes
• New bounds on 2-frameproof codes of length 4
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Frameproof Codes
• Title not available (Why is that?)
• Asymptotic bounds on frameproof codes
• Improved bounds on 2-frameproof codes with length 4
• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
• Improved bounds on the size of separating hash families of short length
• On tight bounds for binary frameproof codes
• New upper bounds for parent-identifying codes and traceability codes
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

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)