Applications of list decoding to tracing traitors
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2081065
- Secure List Decoding and its Application to Bit-String Commitment
- scientific article; zbMATH DE number 1759459
- Publication:4828940
- Guessing secrets efficiently via list decoding
- Analysis of two tracing traitor schemes via coding theory
- The Security of All Bits Using List Decoding
- Efficient Traitor Tracing from Collusion Secure Codes
- Theory of Cryptography
- A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes
Cited in
(10)- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- On application of algebraic geometry codes of \(L\)-construction in copy protection
- New upper bounds for parent-identifying codes and traceability codes
- scientific article; zbMATH DE number 2081065 (Why is no real title available?)
- A Note About the Traceability Properties of Linear Codes
- On the Properties of Algebraic Geometric Codes as Copy Protection Codes
- Proving the security of all bits of ax+b p using list decoding
- Optimal 2-traceability codes of length 4
- Key distribution system based on Hadamard designs
- Efficient Traitor Tracing from Collusion Secure Codes
This page was built for publication: Applications of list decoding to tracing traitors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680091)