Strong Hardness of Privacy from Weak Traitor Tracing
From MaRDI portal
Publication:3179374
DOI10.1007/978-3-662-53641-4_25zbMath1406.94070arXiv1607.06141OpenAlexW2480325051MaRDI QIDQ3179374
Mark Zhandry, Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06141
Related Items (4)
Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Bit security as computational cost for winning games with high probability ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings ⋮ The Complexity of Differential Privacy
Uses Software
Cites Work
- Unnamed Item
- Perfect Structure on the Edge of Chaos
- Contention in Cryptoland: Obfuscation, Leakage and UCE
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- PCPs and the Hardness of Generating Private Synthetic Data
- Efficient noise-tolerant learning from statistical queries
- Strong Hardness of Privacy from Weak Traitor Tracing
- Computational Differential Privacy
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- On the complexity of differentially private data release
- Fingerprinting codes and the price of approximate differential privacy
- How to use indistinguishability obfuscation
- Advances in Cryptology – CRYPTO 2004
- A learning theory approach to noninteractive database privacy
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Theory of Cryptography
This page was built for publication: Strong Hardness of Privacy from Weak Traitor Tracing
