Optimal probabilistic fingerprint codes
From MaRDI portal
Publication:5900523
DOI10.1145/1346330.1346335zbMath1311.94109OpenAlexW2031722321MaRDI QIDQ5900523
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1346330.1346335
Linear codes (general theory) (94B05) Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62)
Related Items (13)
Efficient Identity-Based Outsider Anonymous Public-Key Trace and Revoke with Constant Ciphertext-Size and Fast Decryption ⋮ Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds ⋮ Fingerprinting Codes and the Price of Approximate Differential Privacy ⋮ Unnamed Item ⋮ Making \textit{any} attribute-based encryption accountable, efficiently ⋮ Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ On differential privacy and adaptive data analysis with bounded space ⋮ Arrangements of Pseudocircles: Triangles and Drawings ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ Communication Optimal Tardos-Based Asymmetric Fingerprinting ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ Separable collusion-secure multimedia codes
This page was built for publication: Optimal probabilistic fingerprint codes
