Optimal probabilistic fingerprint codes

From MaRDI portal
Publication:5901096

DOI10.1145/780542.780561zbMath1192.94127OpenAlexW2131267390MaRDI QIDQ5901096

Gábor Tardos

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780561




Related Items (29)

Traceable secret sharing and applicationsEqual-Weight Fingerprinting CodesTraceable PRFs: Full Collusion Resistance and Active SecurityBlack-box Trace\&Revoke codesTracing a linear subspace: application to linearly-homomorphic group signaturesGeneralization of IPP codes and IPP set systemsTraceability codes and their generalizationsAccusation probabilities in Tardos codes: beyond the Gaussian approximationTracing quantum state distinguishers via backtrackingOptimal symmetric Tardos traitor tracing schemesAn Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short LengthsSignature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensingExistence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noiseBinary and \(q\)-ary Tardos codes, revisitedFalse negative probabilities in Tardos codesOn the Effects of Pirate Evolution on the Design of Digital Content Distribution SystemsSequential Monte Carlo for rare event estimationFully collusion-resistant traitor tracing scheme with shorter ciphertextsFully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private KeysTracing Malicious Proxies in Proxy Re-encryptionAn improvement of discrete Tardos fingerprinting codesSymmetric Tardos fingerprinting codes for arbitrary alphabet sizesImproved versions of Tardos' fingerprinting schemeTraitors Collaborating in Public: Pirates 2.0Efficient Traitor Tracing from Collusion Secure CodesCollusion resistant watermarkable PRFs from standard assumptionsNew techniques for traitor tracing: size \(N^{1/3}\) and more from pairingsFalse positive probabilities in \(q\)-ary Tardos codes: comparison of attacksThe Complexity of Differential Privacy







This page was built for publication: Optimal probabilistic fingerprint codes