Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Moreira, J.; Fernandez, M.; Kabatiansky, G.
Tipus d'activitat
Article en revista
Revista
Designs codes and cryptography
Data de publicació
2015-03-27
Volum
80
Número
1
Pàgina inicial
11
Pàgina final
28
DOI
https://doi.org/10.1007/s10623-015-0060-z Obrir en finestra nova
Projecte finançador
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
Repositori
http://hdl.handle.net/2117/103432 Obrir en finestra nova
URL
http://link.springer.com/article/10.1007%2Fs10623-015-0060-z Obrir en finestra nova
Resum
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...
Citació
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.
Paraules clau
Separating Code, Secure Frameproof Code, Fingerprinting, Traitor Tracing, Digital Data, Traitors
Grup de recerca
ISG - Grup de Seguretat de la Informació

Participants

Arxius