Loading...
Loading...

Go to the content (press return)

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

Author
Moreira, J.; Fernandez, M.; Kabatiansky, G.
Type of activity
Journal article
Journal
Designs codes and cryptography
Date of publication
2015-03-27
Volume
80
Number
1
First page
11
Last page
28
DOI
https://doi.org/10.1007/s10623-015-0060-z Open in new window
Project funding
Ares - Team for Advanced REsearch on information Security and privacy
Ares. team for Advanced REsearch on information Security and privacy
Códigos para la protección de la propiedad industrial
Repository
http://hdl.handle.net/2117/103432 Open in new window
URL
http://link.springer.com/article/10.1007%2Fs10623-015-0060-z Open in new window
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...
Citation
Moreira, J., Fernandez, M., Kabatiansky, G. Almost separating and almost secure frameproof codes over q-ary alphabets. "Designs codes and cryptography", 27 Març 2015, vol. 80, núm. 1, p. 11-28.
Keywords
DIGITAL DATA, Fingerprinting, Secure frameproof code, Separating code, TRAITORS, Traitor tracing
Group of research
ISG - Information Security Group

Participants

Attachments