Fingerprinting concatenated codes with efficient identification

DOI10.1007/3-540-45811-5_36MaRDI QIDQ4408468zbMATH OpenFDO

Authors Marcos Soriano, M. Fernandez

Publication date 29 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2433/24330459.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• A 2-secure code with efficient tracing algorithm
• Binary fingerprinting codes
• Equal-Weight Fingerprinting Codes

Cited in

(6)

• A 2-secure code with efficient tracing algorithm
• Reed Solomon codes for digital fingerprinting
• scientific article; zbMATH DE number 7051201 (Why is no real title available?)
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes
• Optimal probabilistic fingerprint codes

This page was built for publication: Fingerprinting concatenated codes with efficient identification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408468)