Analysis of two tracing traitor schemes via coding theory

Elena Egorova, Grigory Kabatiansky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)

Abstract

We compare two popular tracing traitor schemes (1) using non-binary codes with identifiable parent property (IPP-codes) and (2) using family of sets with identifiable parent property. We establish a natural basis for comparing and show that the second approach is stronger than IPP-codes. We also establish a new lower bound on the cardinality of the family of sets with identifiable parent property.

Original languageEnglish
Title of host publicationCoding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings
EditorsAngela I. Barbero, Vitaly Skachek, Oyvind Beck
PublisherSpringer Verlag
Pages84-92
Number of pages9
ISBN (Print)9783319662770
DOIs
Publication statusPublished - 2017
Event5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017 - Vihula, Estonia
Duration: 28 Aug 201731 Aug 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10495 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017
Country/TerritoryEstonia
CityVihula
Period28/08/1731/08/17

Fingerprint

Dive into the research topics of 'Analysis of two tracing traitor schemes via coding theory'. Together they form a unique fingerprint.

Cite this