On non-binary traceability set systems
From MaRDI portal
Publication:2200518
DOI10.1007/S10623-020-00749-4zbMATH Open1453.94160OpenAlexW3012514826MaRDI QIDQ2200518FDOQ2200518
Grigory Kabatiansky, Marcel Fernández, E. Egorova
Publication date: 22 September 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/336017
Recommendations
Cites Work
- Generalized hashing and parent-identifying codes.
- How to share a secret
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial properties of frameproof and traceability codes
- Title not available (Why is that?)
- On codes with the identifiable parent property
- Traceability codes
- Families of finite sets in which no set is covered by the union of \(r\) others
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Title not available (Why is that?)
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Title not available (Why is that?)
- Analysis of two tracing traitor schemes via coding theory
- Upper bounds for parent-identifying set systems
- Probabilistic Existence Results for Parent-Identifying Schemes
- New results on frame-proof codes and traceability schemes
- A class of traceability codes
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Bounds on Traceability Schemes
- On the tracing traitors math. Dedicated to the memory of Bob Blakley -- pioneer of digital fingerprinting and inventor of secret sharing
- Comments on "New results on frame-proof codes and traceability schemes
Cited In (3)
This page was built for publication: On non-binary traceability set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200518)
