Collusion-secure fingerprinting for digital data
From MaRDI portal
Publication:4701165
DOI10.1109/18.705568zbMath0931.94051OpenAlexW2134195444MaRDI QIDQ4701165
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
Related Items
Almost Optimal Cover-Free Families ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Separation and Witnesses ⋮ Equal-Weight Fingerprinting Codes ⋮ On differential privacy and adaptive data analysis with bounded space ⋮ Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory ⋮ The average sensitivity of an intersection of half spaces ⋮ An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths ⋮ 2-secure codes from 2-SFP codes ⋮ Binary \(B_2\)-sequences: a new upper bound ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ 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 ⋮ Primal beats dual on online packing LPs in the random-order model ⋮ Competitive algorithms from competitive equilibria ⋮ Minimum bisection is fixed parameter tractable ⋮ An efficient parallel solver for SDD linear systems ⋮ Solving SDD linear systems in nearly m log 1/2 n time ⋮ From hierarchical partitions to hierarchical covers ⋮ Shortest paths on polyhedral surfaces and terrains ⋮ Embedding and canonizing graphs of bounded genus in logspace ⋮ Testing surface area with arbitrary accuracy ⋮ Coin flipping of any constant bias implies one-way functions ⋮ Infinite randomness expansion with a constant number of devices ⋮ From average case complexity to improper learning complexity ⋮ Bandits with switching costs ⋮ Online local learning via semidefinite programming ⋮ How to use indistinguishability obfuscation ⋮ How to delegate computations ⋮ Circuits resilient to additive attacks with applications to secure computation ⋮ On the existence of extractable one-way functions ⋮ Black-box non-black-box zero knowledge ⋮ Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions ⋮ Query complexity of approximate nash equilibria ⋮ Constant rank bimatrix games are PPAD-hard ⋮ Approximation algorithms for bipartite matching with metric and geometric costs ⋮ Distributed approximation algorithms for weighted shortest paths ⋮ Parallel algorithms for geometric graph problems ⋮ Fourier PCA and robust tensor decomposition ⋮ Smoothed analysis of tensor decompositions ⋮ Efficient density estimation via piecewise polynomial approximation ⋮ Analytical approach to parallel repetition ⋮ A characterization of strong approximation resistance ⋮ A strongly polynomial algorithm for generalized flow maximization ⋮ Approximate distance oracles with constant query time ⋮ Faster all-pairs shortest paths via circuit complexity ⋮ Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs ⋮ Zig-zag sort ⋮ Community detection thresholds and the weak Ramanujan property ⋮ Distributed computability in Byzantine asynchronous systems ⋮ Multiway cut, pairwise realizable distributions, and descending thresholds ⋮ Cluster before you hallucinate ⋮ Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing ⋮ Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements ⋮ Every list-decodable code for high noise has abundant near-optimal rate puncturings ⋮ Non-malleable codes from additive combinatorics ⋮ Breaking the quadratic barrier for 3-LCC's over the reals ⋮ Optimal error rates for interactive coding I ⋮ The asymptotic k-SAT threshold ⋮ Satisfiability threshold for random regular NAE-SAT ⋮ Efficient deterministic approximate counting for low-degree polynomial threshold functions ⋮ Communication lower bounds via critical block sensitivity ⋮ Computing with a full memory ⋮ Hitting sets for multilinear read-once algebraic branching programs, in any order ⋮ List decoding for a multiple access hyperchannel ⋮ Strongly separable codes ⋮ A TTP-independent watermarking protocol based on commutative cryptosystem for copyright protection in e-commerce ⋮ Localized image watermarking based on feature points of scale-space representation ⋮ Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region ⋮ Communication is Bounded by Root of Rank ⋮ Are Lock-Free Concurrent Algorithms Practically Wait-Free? ⋮ Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices ⋮ The Power of Localization for Efficiently Learning Linear Separators with Noise ⋮ Sliding-window dynamic frameproof codes ⋮ Sequential and dynamic frameproof codes ⋮ On optimal codes with \(w\)-identifiable parent property ⋮ Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ Fingerprinting Codes and the Price of Approximate Differential Privacy ⋮ Unnamed Item ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ On Symmetric Designs and Binary 3-Frameproof Codes ⋮ A simple fingerprinting scheme for large user groups ⋮ Improved bounds for separating hash families ⋮ \((2,1)\)-separating systems beyond the probabilistic bound ⋮ Multimedia IPP codes with efficient tracing ⋮ On tight bounds for binary frameproof codes ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ Accusation probabilities in Tardos codes: beyond the Gaussian approximation ⋮ RFID authentication efficient proactive information security within computational security ⋮ Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3 ⋮ Bounds for separating hash families ⋮ Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Optimal CUR Matrix Decompositions ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Efficient construction of provably secure steganography under ordinary covert channels ⋮ Generalized hashing and parent-identifying codes. ⋮ Wide-sense 2-frameproof codes ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ Binary and \(q\)-ary Tardos codes, revisited ⋮ False negative probabilities in Tardos codes ⋮ On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems ⋮ Deciding First-Order Properties of Nowhere Dense Graphs ⋮ The Matching Polytope has Exponential Extension Complexity ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ On traceability property of equidistant codes ⋮ Asymptotically optimal \(\overline {2}\)-separable codes with length 4 ⋮ On generalized separating hash families ⋮ Cover-free codes and separating system codes ⋮ Symmetric disjunctive list-decoding codes ⋮ New bounds on 2-frameproof codes of length 4 ⋮ Bounds on the rate of separating codes ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Binary fingerprinting codes ⋮ Economic efficiency requires interaction ⋮ Fully collusion-resistant traitor tracing scheme with shorter ciphertexts ⋮ Recursive constructions of secure codes and hash families using difference function families. ⋮ Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys ⋮ New constructions for IPP codes ⋮ Constructions and bounds for separating hash families ⋮ An improvement of discrete Tardos fingerprinting codes ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ Separable collusion-secure multimedia codes ⋮ Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes ⋮ Improved versions of Tardos' fingerprinting scheme ⋮ A class of I.P.P. codes with efficient identification ⋮ Distributing hash families with few rows ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ Fingerprinting codes and the price of approximate differential privacy ⋮ Analyze gauss ⋮ 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 ⋮ 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 ⋮ Breaking the minsky-papert barrier for constant-depth circuits ⋮ False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks ⋮ The Complexity of Differential Privacy ⋮ Anonymous trace and revoke ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
