Analysis and prevention of averaging attacks against obfuscation protocols
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A method for obtaining digital signatures and public-key cryptosystems
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Auditing Boolean attributes
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Differential Privacy
- Elements of Information Theory
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- High-dimensional statistics. A non-asymptotic viewpoint
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1614382 (Why is no real title available?)
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- Introduction to modern cryptography
- On some asymptotic laws in number theory
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure collaborative supply chain planning and inverse optimization -- the JELS model
- Secure statistical databases with random sample queries
- Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
This page was built for publication: Analysis and prevention of averaging attacks against obfuscation protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535088)