Almost separating and almost secure frameproof codes over q -ary alphabets

José Moreira, Marcel Fernández, Grigory Kabatiansky

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In this paper we discuss some variations of the notion of separating code for alphabets of arbitrary size. We show how the original definition can be relaxed in two different ways, namely almost separating and almost secure frameproof codes, yielding two different concepts. The new definitions enable us to obtain codes of higher rate, at the expense of satisfying the separating property partially. These new definitions become useful when complete separation is only required with high probability, rather than unconditionally. We also show how the codes proposed can be used to improve the rate of existing constructions of families of fingerprinting codes.

Original languageEnglish
Pages (from-to)11-28
Number of pages18
JournalDesigns, Codes, and Cryptography
Volume80
Issue number1
DOIs
Publication statusPublished - 1 Jul 2016
Externally publishedYes

Keywords

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

Fingerprint

Dive into the research topics of 'Almost separating and almost secure frameproof codes over q -ary alphabets'. Together they form a unique fingerprint.

Cite this