|
Título:
|
Almost separating and almost secure frameproof codes over q-ary alphabets
|
|
Autor/a:
|
Moreira Sánchez, José; Fernández Muñoz, Marcel; Kabatiansky, Grigory
|
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica; Universitat Politècnica de Catalunya. ISG - Grup de Seguretat de la Informació |
|
Abstract:
|
The final publication is available at Springer via http://dx.doi.org/10.1007/s10623-015-0060-z |
|
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. |
|
Abstract:
|
Peer Reviewed |
|
Materia(s):
|
-Àrees temàtiques de la UPC::Enginyeria de la telecomunicació
-Fingerprints
-Secure frameproof code
-Separating code
-Secure frameproof code
-Fingerprinting
-Traitor tracing
-DIGITAL DATA
-TRAITORS
-Seguretat informàtica
-Dactiloscòpia |
|
Derechos:
|
|
|
Tipo de documento:
|
Artículo - Versión presentada
Artículo |
|
Compartir:
|
|
