Towards constructing fully homomorphic encryption without ciphertext noise from group theory

DOI10.1007/978-981-15-5191-8_8MaRDI QIDQ4964355zbMATH OpenOpenAlexFDO

Authors Koji Nuida

Publication date 25 February 2021

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

Copyright license File:Creative commons license with attribution.png Creative Commons Attribution 4.0 International

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) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• (Leveled) fully homomorphic encryption without bootstrapping
• (Leveled) fully homomorphic encryption without bootstrapping
• Fully homomorphic encryption over the integers
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomorphic encryption from approximate ideal lattices

Cites work

• (Batch) fully homomorphic encryption over integers for non-binary message spaces
• Better bootstrapping in fully homomorphic encryption
• Communication Complexity in Algebraic Two-Party Protocols
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Generating random elements in finite groups.
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 51906 (Why is no real title available?)
• scientific article; zbMATH DE number 1206942 (Why is no real title available?)
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• On the commuting probability in finite groups.
• Presentations of finite simple groups: a quantitative approach.

Cited in

(5)

• Comparison-based attacks against noise-free fully homomorphic encryption schemes
• Homomorphic encryption: a mathematical survey
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• On compression functions over groups with applications to homomorphic encryption
• Boolean arithmetic over \(\mathbb{F}_2\) from group commutators

This page was built for publication: Towards constructing fully homomorphic encryption without ciphertext noise from group theory

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