Binary Fingerprinting Codes

Authors:
J. Löfvenberg
Affiliations:
Department of Electrical Engineering, Linköpings Universitet, Linköping, Sweden SE-581 83
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 7
Cited 0

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

SIAM Journal on Discrete Mathematics
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
A class of traceability codes

IEEE Transactions on Information Theory
More on (2,2)-separating systems

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three binary fingerprinting code classes with properties similar to codes with the identifiable parent property are proposed. In order to compare such codes a new combinatorial quality measure is introduced. In the case of two cooperating pirates the measure is derived for the proposed codes, upper and lower bounds are constructed and the results of computer searches for good codes in the sense of the quality measure are presented. Some properties of the quality measure are also derived.