Collusion-secure fingerprinting for digital data
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Improved versions of Tardos' fingerprinting scheme
- Generalized hashing and parent-identifying codes.
- New upper bounds for parent-identifying codes and traceability codes
- Obfuscation in digital fingerprinting
- Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- Bounds on the rate of separating codes
- Improved bounds on 2-frameproof codes with length 4
- New constructions for IPP codes
- A class of I.P.P. codes with efficient identification
- Localized image watermarking based on feature points of scale-space representation
- New bounds on 2-frameproof codes of length 4
- On 2-parent-identifying set systems of block size 4
- Separable collusion-secure multimedia codes
- Collusion resistant watermarkable PRFs from standard assumptions
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- Multimedia IPP codes with efficient tracing
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Wide-sense 2-frameproof codes
- Improved upper bounds for parent-identifying set systems and separable codes
- Publicly evaluatable perceptual hashing
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- A tight bound for frameproof codes viewed in terms of separating hash families
- Distributing hash families with few rows
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Anonymous trace and revoke
- List decoding for a multiple access hyperchannel
- Sliding-window dynamic frameproof codes
- Sequential and dynamic frameproof codes
- On optimal codes with \(w\)-identifiable parent property
- RFID authentication efficient proactive information security within computational security
- Bounds for separating hash families
- On generalized separating hash families
- Binary fingerprinting codes
- Recursive constructions of secure codes and hash families using difference function families.
- Answering n^2+o(1) counting queries with differential privacy is hard
- Strongly separable codes
- Almost separating and almost secure frameproof codes over q-ary alphabets
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3
- Traitor tracing for shortened and corrupted fingerprints
- A TTP-independent watermarking protocol based on commutative cryptosystem for copyright protection in e-commerce
- On symmetric designs and binary 3-frameproof codes
- A simple fingerprinting scheme for large user groups
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Improved bounds for separating hash families
- \((2,1)\)-separating systems beyond the probabilistic bound
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- scientific article; zbMATH DE number 1256768 (Why is no real title available?)
- scientific article; zbMATH DE number 1030976 (Why is no real title available?)
- Efficient construction of provably secure steganography under ordinary covert channels
- scientific article; zbMATH DE number 1980958 (Why is no real title available?)
- scientific article; zbMATH DE number 2044549 (Why is no real title available?)
- scientific article; zbMATH DE number 2042811 (Why is no real title available?)
- scientific article; zbMATH DE number 1759345 (Why is no real title available?)
- Fingerprinting codes and the price of approximate differential privacy
- scientific article; zbMATH DE number 2087911 (Why is no real title available?)
- scientific article; zbMATH DE number 1893220 (Why is no real title available?)
- New bounds on \(\bar{2}\)-separable codes of length 2
- Binary and \(q\)-ary Tardos codes, revisited
- False negative probabilities in Tardos codes
- The complexity of differential privacy
- Protocols for collusion-secure asymmetric fingerprinting (extended abstract)
- On traceability property of equidistant codes
- Asymptotically optimal \(\overline {2}\)-separable codes with length 4
- Cover-free codes and separating system codes
- Symmetric disjunctive list-decoding codes
- Fingerprints resistant to collusion attacks
- Simultaneous private learning of multiple concepts
- Fingerprinting codes and the price of approximate differential privacy
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Private matchings and allocations
- Rounding sum-of-squares relaxations
- Constant factor approximation for balanced cut in the PIE model
- Entropy, optimization and counting
- Polynomial bounds for the grid-minor theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
- On derandomizing algorithms that err extremely rarely
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
- Lower bounds for depth 4 formulas computing iterated matrix multiplication
- The limits of depth reduction for arithmetic formulas
- A super-polynomial lower bound for regular arithmetic formulas
- A characterization of locally testable affine-invariant properties via decomposition theorems
- L_p-testing
- Turnstile streaming algorithms might as well be linear sketches
- Linear time construction of compressed text indices in compact space
- Formulas vs. circuits for small distance connectivity
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Breaking the Minsky-Papert barrier for constant-depth circuits
- Economic efficiency requires interaction
- The sample complexity of revenue maximization
- Optimal competitive auctions
- Homological product codes
- A quantum algorithm for computing the unit group of an arbitrary degree number field
This page was built for publication: Collusion-secure fingerprinting for digital data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701165)
