Optimal probabilistic fingerprint codes
From MaRDI portal
Recommendations
Cited in
(43)- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Improved versions of Tardos' fingerprinting scheme
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- Collusion resistant watermarkable PRFs from standard assumptions
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- Traceable secret sharing and applications
- On fingerprinting attacks and length-hiding encryption
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Optimal symmetric Tardos traitor tracing schemes
- Binary fingerprinting codes
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems
- Several new frameproof codes and secure frameproof codes
- Short \(c\)-secure fingerprinting codes
- Optimal Monotone Encodings
- Optimal fingerprinting strategies with one-sided error
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Tracing Malicious Proxies in Proxy Re-encryption
- Traitors Collaborating in Public: Pirates 2.0
- Black-box Trace\&Revoke codes
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- scientific article; zbMATH DE number 1955790 (Why is no real title available?)
- scientific article; zbMATH DE number 2080172 (Why is no real title available?)
- scientific article; zbMATH DE number 1759652 (Why is no real title available?)
- scientific article; zbMATH DE number 7051201 (Why is no real title available?)
- Binary and \(q\)-ary Tardos codes, revisited
- False negative probabilities in Tardos codes
- A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure
- An improvement of pseudorandomization against unbounded attack algorithms -- the case of fingerprint codes
- The complexity of differential privacy
- Traceable PRFs: full collusion resistance and active security
- Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes
- Equal-Weight Fingerprinting Codes
- An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
- Efficient Traitor Tracing from Collusion Secure Codes
- Optimal probabilistic fingerprint codes
- Tracing a linear subspace: application to linearly-homomorphic group signatures
- Tracing quantum state distinguishers via backtracking
- Sequential Monte Carlo for rare event estimation
- An improvement of discrete Tardos fingerprinting codes
This page was built for publication: Optimal probabilistic fingerprint codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901096)
