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 Creative Commons Attribution 4.0 International

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

zbMATH Keywords

fully homomorphic encryptionnon-commutative groupcombinatorial group theory

Mathematics Subject Classification ID

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

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

• 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?)
• (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
• FHEW: bootstrapping homomorphic encryption in less than a second
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Generating random elements in finite groups.
• 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

(3)

• Comparison-based attacks against noise-free fully homomorphic encryption schemes
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• Homomorphic encryption: a mathematical survey

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)