Constructions of almost secure frameproof codes with applications to fingerprinting schemes

José Moreira, Marcel Fernández, Grigory Kabatiansky

Research output: Contribution to journalArticlepeer-review

Abstract

This paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes. An almost secure frameproof code is a relaxed version of a secure frameproof code, which in turn is the same as a separating code. This relaxed version is the object of our interest because it gives rise to fingerprinting codes of higher rate than fingerprinting codes derived from separating codes. The construction of almost secure frameproof codes discussed here is based on weakly biased arrays, a class of combinatorial objects tightly related to weakly dependent random variables.

Original languageEnglish
Pages (from-to)785-802
Number of pages18
JournalDesigns, Codes, and Cryptography
Volume86
Issue number4
DOIs
Publication statusPublished - 1 Apr 2018

Keywords

  • Fingerprinting
  • Secure frameproof code
  • Separating code
  • Traitor tracing

Fingerprint

Dive into the research topics of 'Constructions of almost secure frameproof codes with applications to fingerprinting schemes'. Together they form a unique fingerprint.

Cite this