On homomorphic encryption using abelian groups: classical security analysis

DOI10.1007/978-3-031-52163-8_1zbMATH Open1547.94303MaRDI QIDQ6611632

Mima Stanojkovski, Chloe Martindale, Annette Bachmayr, Vishnupriya Anupindi, Eleni Agathocleous, Rahinatou Yuh Njah Nchiwo

Publication date: 27 September 2024

zbMATH Keywords

additively homomorphic public key encryption schemequantum attacks on instantiations with solvable groups

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• TFHE: fast fully homomorphic encryption over the torus
• The quantum query complexity of the hidden subgroup problem is polynomial
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Structure computation and discrete logarithms in finite abelian $p$-groups
• Generalized Learning Problems and Applications to Non-commutative Cryptography
• The Parallel Complexity of Abelian Permutation Group Problems
• Symbolic Collection using Deep Thought
• Quantum computations: algorithms and error correction
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• On Ideal Lattices and Learning with Errors over Rings
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On homomorphic encryption using abelian groups: classical security analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611632)