Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces

DOI10.1007/978-3-642-41383-4_4MaRDI QIDQ3190014zbMATH OpenOpenAlexFDO

Authors

Publication date 15 September 2014

Published in Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41383-4_4

zbMATH Keywords

fingerprintingsecure frameproof codeseparating codetraitor tracing

Mathematics Subject Classification ID

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

Recommendations

• Constructions of almost secure frameproof codes with applications to fingerprinting schemes
• On tight bounds for binary frameproof codes
• scientific article; zbMATH DE number 2069521
• Asymptotic bounds on frameproof codes
• Almost separating and almost secure frameproof codes over q-ary alphabets
• Improved Constructions of Frameproof Codes
• New Bounds for Frameproof Codes
• Some new p-ary two-secure frameproof codes
• A new method for constructing small-bias spaces from Hermitian codes
• Several new frameproof codes and secure frameproof codes

Cited in

(2)

• Constructions of almost secure frameproof codes with applications to fingerprinting schemes
• Almost separating and almost secure frameproof codes over q-ary alphabets

This page was built for publication: Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces

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