Verifiable computation for approximate homomorphic encryption schemes
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A full RNS variant of approximate homomorphic encryption
- Algorithms in HElib
- Approximate homomorphic encryption with reduced approximation error
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Constant-Size Commitments to Polynomials and Their Applications
- Delegating computation: interactive proofs for muggles
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Efficient Protocols for Set Membership and Range Proofs
- Fast Reed-Solomon interactive oracle proofs of proximity
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Flexible and efficient verifiable computation on encrypted data
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to prove false statements: practical attacks on Fiat-Shamir
- How to prove statements obliviously?
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Improved bootstrapping for approximate homomorphic encryption
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-time arguments with sublinear verification from tensor codes
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- On the precision loss in approximate homomorphic encryption
- Proximity gaps for Reed-Solomon codes
- Rinocchio: SNARKs for ring arithmetic
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Transparent SNARKs from DARK compilers
- Unlocking the lookup singularity with \textsf{Lasso}
This page was built for publication: Verifiable computation for approximate homomorphic encryption schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862519)
