Two-Level Fingerprinting Codes: Non-Trivial Constructions
Penying Rochanakul

TL;DR
This paper extends two-level fingerprinting codes to various types, providing the first explicit non-trivial constructions for IPP, SFP, and FP codes, enhancing traceability and security features.
Contribution
It introduces the first explicit non-trivial constructions for two-level IPP, SFP, and FP fingerprinting codes, broadening their applicability.
Findings
First explicit constructions for two-level IPP, SFP, and FP codes.
Enhanced traceability and security in fingerprinting schemes.
Broader applicability of two-level fingerprinting codes.
Abstract
We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes, to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the first explicit non-trivial construction for two-level IPP, SFP and FP codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInternet Traffic Analysis and Secure E-voting · Advanced Steganography and Watermarking Techniques · Cryptographic Implementations and Security
