Constructions of almost secure frameproof codes with applications to fingerprinting schemes |
| |
Authors: | José Moreira Marcel Fernández Grigory Kabatiansky |
| |
Institution: | 1.Department of Network Engineering,Universitat Politècnica de Catalunya (UPC),Barcelona,Spain;2.Skolkovo Institute of Science and Technology (Skoltech),Skolkovo,Russia;3.National Research University Higher School of Economics (HSE),Moscow,Russia |
| |
Abstract: | This paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes. An almost secure frameproof code is a relaxed version of a secure frameproof code, which in turn is the same as a separating code. This relaxed version is the object of our interest because it gives rise to fingerprinting codes of higher rate than fingerprinting codes derived from separating codes. The construction of almost secure frameproof codes discussed here is based on weakly biased arrays, a class of combinatorial objects tightly related to weakly dependent random variables. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|