scientific article; zbMATH DE number 2079373
From MaRDI portal
Publication:4471332
Recommendations
- Short c-secure fingerprinting codes
- Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Binary codes for collusion-secure fingerprinting
- A collusion-secure fingerprinting code reduced by Chinese remaindering and its random-error resilience
Cited in
(10)- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Hardness of \(k\)-LWE and applications in traitor tracing
- Systematic treatment of collusion secure codes: security definitions and their relations
- Short c-secure fingerprinting codes
- Binary codes for collusion-secure fingerprinting
- A collusion-secure fingerprinting code reduced by Chinese remaindering and its random-error resilience
- Simultaneous private learning of multiple concepts
- Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes
- Optimal probabilistic fingerprint codes
- Cryptographic methods for collusion-secure fingerprinting of digital data
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471332)
