Towards constructing fully homomorphic encryption without ciphertext noise from group theory

DOI10.1007/978-981-15-5191-8_8zbMATH Open1459.94136OpenAlexW3093558088MaRDI QIDQ4964355FDOQ4964355

Authors: 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

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

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)

Cites Work

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

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)