Cryptanalysis on lightweight verifiable homomorphic encryption
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Boosting verifiable computation on encrypted data
- Bootstrapping for BGV and BFV revisited
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Flexible and efficient verifiable computation on encrypted data
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic message authenticators
- HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic lower digits removal and improved FHE bootstrapping
- How to prove statements obliviously?
- scientific article; zbMATH DE number 4187706 (Why is no real title available?)
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Practical homomorphic MACs for arithmetic circuits
- Revisiting homomorphic encryption schemes for finite fields
- Rinocchio: SNARKs for ring arithmetic
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- TFHE: fast fully homomorphic encryption over the torus
This page was built for publication: Cryptanalysis on lightweight verifiable homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232723)