2018 · 66 citations · 24 references
ComputingComputer ScienceCybersecurityAuthenticationComputer SecurityCryptographyClassical CryptographyCryptographic ComplexityData SecurityElliptic Curve CryptographyInformation-theoretic CryptographyCollusion-resistant MechanismsLearning With ErrorsLearning With Errors ProblemSecurity ProofsTracing
In this work we provide a traitor tracing construction with ciphertexts that grow polynomially in log(n) where n is the number of users and prove it secure under the Learning with Errors (LWE) assumption. This is the first traitor tracing scheme with such parameters provably secure from a standard assumption. In addition to achieving new traitor tracing results, we believe our techniques push forward the broader area of computing on encrypted data under standard assumptions. Notably, traitor tracing is substantially different problem from other cryptography primitives that have seen recent progress in LWE solutions.
24
How to generate and exchange secrets
Andrew Chi-Chih Yao · 1986 · 3.7K citations
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Sanjam Garg, Craig Gentry, Shai Halevi et al. · 2013 · 1.1K citations
Benny Chor, Amos Fiat, Moni Naor · International Cryptology Conference · 1994 · 480 citations
Attribute-based encryption for circuits
S. Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee · 2013 · 399 citations
On the complexity of differentially private data release
Cynthia Dwork, Moni Naor, Omer Reingold et al. · 2009 · 381 citations