Short c-secure fingerprinting codes
From MaRDI portal
Publication:3404422
DOI10.1007/10958513_32zbMATH Open1255.68065OpenAlexW2149321932MaRDI QIDQ3404422FDOQ3404422
Authors: Tri van le, Jiangyi Hu, M. V. D. Burmester
Publication date: 9 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/10958513_32
Recommendations
Cited In (14)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Title not available (Why is that?)
- An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- Title not available (Why is that?)
- Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes
- Improvement of collusion secure convolutional fingerprinting information codes
- Information Security Practice and Experience
- A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure
- Optimal probabilistic fingerprint codes
This page was built for publication: Short \(c\)-secure fingerprinting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404422)