Collusion-secure fingerprinting for digital data
From MaRDI portal
Publication:4701165
DOI10.1109/18.705568zbMATH Open0931.94051OpenAlexW2134195444MaRDI QIDQ4701165FDOQ4701165
Authors: Dan Boneh, James R. Shaw 
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/60e3d93bbb5b6707b38115608b1dfe430a4b6206
Recommendations
Cited In (only showing first 100 items - show all)
- Wide-sense 2-frameproof codes
- New bounds on 2-frameproof codes of length 4
- On the existence of extractable one-way functions
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Sequential and dynamic frameproof codes
- Embedding and canonizing graphs of bounded genus in logspace
- Homological product codes
- The sample complexity of revenue maximization
- Distributing hash families with few rows
- Smoothed analysis of tensor decompositions
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- Query complexity of approximate nash equilibria
- Efficient density estimation via piecewise polynomial approximation
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Fingerprinting codes and the price of approximate differential privacy
- Equal-Weight Fingerprinting Codes
- Simultaneous private learning of multiple concepts
- An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- Bounds on the rate of separating codes
- Improved bounds on 2-frameproof codes with length 4
- Anonymous trace and revoke
- Traitor tracing for shortened and corrupted fingerprints
- A characterization of strong approximation resistance
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
- A characterization of locally testable affine-invariant properties via decomposition theorems
- Economic efficiency requires interaction
- Optimal error rates for interactive coding. I: Adaptivity and other settings
- Constant rank bimatrix games are PPAD-hard
- New upper bounds for parent-identifying codes and traceability codes
- Distributed computability in Byzantine asynchronous systems
- Binary fingerprinting codes
- Separable collusion-secure multimedia codes
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Obfuscation in digital fingerprinting
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems
- The complexity of differential privacy
- Sliding-window dynamic frameproof codes
- On derandomizing algorithms that err extremely rarely
- On 2-parent-identifying set systems of block size 4
- Infinite randomness expansion with a constant number of devices
- Improved upper bounds for parent-identifying set systems and separable codes
- Multimedia IPP codes with efficient tracing
- Recursive constructions of secure codes and hash families using difference function families.
- Zig-zag sort
- From average case complexity to improper learning complexity
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
- An efficient parallel solver for SDD linear systems
- From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
- Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
- Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
- Computing with a full memory: catalytic space
- Almost optimal cover-free families
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Protocols for collusion-secure asymmetric fingerprinting (extended abstract)
- Collusion resistant watermarkable PRFs from standard assumptions
- Parallel algorithms for geometric graph problems
- Bandits with switching costs, \(T^{2/3}\) regret
- Fourier PCA and robust tensor decomposition
- Optimal competitive auctions
- Black-box non-black-box zero knowledge
- A TTP-independent watermarking protocol based on commutative cryptosystem for copyright protection in e-commerce
- Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
- Title not available (Why is that?)
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online local learning via semidefinite programming
- Title not available (Why is that?)
- Fingerprinting codes and the price of approximate differential privacy
- Turnstile streaming algorithms might as well be linear sketches
- Testing surface area with arbitrary accuracy
- Breaking the Minsky-Papert barrier for constant-depth circuits
- Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
- Answering \(n^2+o(1)\) counting queries with differential privacy is hard
- Title not available (Why is that?)
- 2-secure codes from 2-SFP codes
- On differential privacy and adaptive data analysis with bounded space
- Private matchings and allocations
- Separation and Witnesses
- Cryptographic methods for collusion-secure fingerprinting of digital data
- Accountability for misbehavior in threshold decryption via threshold traitor tracing
- Fingerprints resistant to collusion attacks
- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
- On symmetric designs and binary 3-frameproof codes
- The average sensitivity of an intersection of half spaces
- Distributed approximation algorithms for weighted shortest paths
- Formulas vs. circuits for small distance connectivity
- \((2,1)\)-separating systems beyond the probabilistic bound
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- New constructions for IPP codes
- Symmetric disjunctive list-decoding codes
- Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
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)
