On compression functions over groups with applications to homomorphic encryption
From MaRDI portal
Cites work
- (Batch) fully homomorphic encryption over integers for non-binary message spaces
- Bootstrapping for approximate homomorphic encryption
- Communication Complexity in Algebraic Two-Party Protocols
- Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- FHEW: bootstrapping homomorphic encryption in less than a second
- FINAL: faster FHE instantiated with NTRU and LWE
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 2196515 (Why is no real title available?)
- Introduction to Modern Cryptography
- Non-uniform automata over groups
- On non-Abelian homomorphic public-key cryptosystems
- TFHE: fast fully homomorphic encryption over the torus
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
This page was built for publication: On compression functions over groups with applications to homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239073)