2-secure codes from 2-SFP codes
The authors follow and generalize the technique used by them in a previous article [cf. Progress in cryptology -- INDOCRYPT 2002. Third international conference on cryptology in India, Hyderabad, India, December 16--18, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2551, 149--162 (2002; Zbl 1033.94542)]. They present a way to turn a binary 2-secure frameproof code (SFP) into a 2-secure code, and derive a generic tracing algorithm that can be applied to any 2--secure frameproof code to trace all so called non-special pirate words. Furthermore they show that any dual Hamming code (simplex code) is a 2-secure frameproof code and that the new tracing algorithm improves the tracing for this code (previously studied by \textit{J. Domingo-Ferrer} and \textit{J.\ Herrera-Joancomarti} [Short collusion-secure fingerprints based on dual Hamming codes. Electronic letters 36(20), 1697--1699 (2000)]).
- Wide-sense 2-frameproof codes
- Secure Network Coding for Wiretap Networks of Type II
- A 2-secure code with efficient tracing algorithm
- Some new p-ary two-secure frameproof codes
- Secret Sharing Schemes from Two-Weight Codes
- Some new classes of 2-fold optimal or perfect splitting authentication codes
- Two-Way Source-Channel Coding
- Providing Secrecy With Structured Codes: Two-User Gaussian Channels
- Collusion-secure fingerprinting for digital data
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- On codes with the identifiable parent property
- Parent-identifying codes
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
This page was built for publication: 2-secure codes from 2-SFP codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5718002)
