Analysis and prevention of averaging attacks against obfuscation protocols

DOI10.1007/978-3-031-33488-7_17zbMath1542.94107MaRDI QIDQ6535088

Kilian Becher, Thorsten Strufe, J. A. Gregor Lagodzinski, Javier Parra-Arnau

Publication date: 9 November 2023

zbMATH Keywords

homomorphic encryptionaveraging attacksconfidentiality-utility tradeoffoutput obfuscationruntime bounds

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Secure collaborative supply chain planning and inverse optimization -- the JELS model
• Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
• Auditing Boolean attributes
• On some asymptotic laws in number theory
• Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Secure statistical databases with random sample queries
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• High-Dimensional Statistics
• Fully homomorphic encryption using ideal lattices
• Elements of Information Theory
• Differential Privacy

This page was built for publication: Analysis and prevention of averaging attacks against obfuscation protocols