Constructions of almost secure frameproof codes based on small-bias probability spaces

José Moreira, Marcel Fernández, Grigory Kabatiansky

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

1 Citation (Scopus)

Abstract

Secure frameproof code is the name given to a separating code when studied in relation to fingerprinting schemes. Separating codes are combinatorial objects that have found to be useful in many areas such as technical diagnosis and the protection of distribution rights. A relaxed definition of the properties of separation and frameproofness, in the sense of only requiring the properties to hold with high probability, shows that for the relaxed definitions these notions are different. In this paper we address the construction of almost secure frameproof codes based on small-bias probability spaces.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security - 8th International Workshop on Security, IWSEC 2013, Proceedings
Pages53-67
Number of pages15
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event8th International Workshop on Security, IWSEC 2013 - Okinawa, Japan
Duration: 18 Nov 201320 Nov 2013

Publication series

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

Conference

Conference8th International Workshop on Security, IWSEC 2013
Country/TerritoryJapan
CityOkinawa
Period18/11/1320/11/13

Keywords

  • fingerprinting
  • Secure frameproof code
  • separating code
  • traitor tracing

Fingerprint

Dive into the research topics of 'Constructions of almost secure frameproof codes based on small-bias probability spaces'. Together they form a unique fingerprint.

Cite this