Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory

DOI10.1007/978-981-15-5191-8_8zbMath1459.94136OpenAlexW3093558088MaRDI QIDQ4964355

Koji Nuida

Publication date: 25 February 2021

Published in: International Symposium on Mathematics, Quantum Theory, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-5191-8_8

zbMATH Keywords

combinatorial group theoryfully homomorphic encryptionnon-commutative group

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Information storage and retrieval of data (68P20)

Related Items

Homomorphic encryption: a mathematical survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating random elements in finite groups.
• On the commuting probability in finite groups.
• Better Bootstrapping in Fully Homomorphic Encryption
• Fully Homomophic Encryption over the Integers Revisited
• (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• Fully Homomorphic Encryption over the Integers
• Presentations of finite simple groups: A quantitative approach
• Communication Complexity in Algebraic Two-Party Protocols
• Fully homomorphic encryption using ideal lattices
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols