Characteristics of Some Binary Codes for Fingerprinting

Authors:
Tina Lindkvist
Affiliations:
-
Venue:
ISW '00 Proceedings of the Third International Workshop on Information Security
Year:
2000

Citing 7
Cited 0

Fingerprinting long forgiving messages

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
An Efficient Public Key Traitor Tracing Scheme

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Fingerprinting

SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
Asymmetric fingerprinting

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Anonymous fingerprinting

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

A digital fingerprint is a unique pattern embedded in a digital document to be able to identify a specific copy when it is used illegally. We have looked at two specific code structures for fingerprinting purpose. Binary linear codes, often used as error correcting codes, and what we call a binary sorted code.