Flexible and efficient verifiable computation on encrypted data
From MaRDI portal
Recommendations
- Boosting verifiable computation on encrypted data
- Verifiable computation on outsourced encrypted data
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Aurora: transparent succinct arguments for R1CS
- Boosting verifiable computation on encrypted data
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fiat-Shamir: from practice to theory
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic SIMD operations
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic lower digits removal and improved FHE bootstrapping
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- How to run Turing machines on encrypted data
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Modern computer algebra
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Practical verified computation with streaming interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Time-optimal interactive proofs for circuit evaluation
Cited in
(22)- Fine-grained secure computation
- Boosting verifiable computation on encrypted data
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- A domain-specific language for computing on encrypted data. (Invited talk)
- Batch Computations Revisited: Combining Key Computations and Batch Verifications
- Verifiable computation on outsourced encrypted data
- Information Security and Cryptology - ICISC 2005
- Private polynomial commitments and applications to MPC
- Rinocchio: SNARKs for ring arithmetic
- Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
- MyOPE: malicious security for oblivious polynomial evaluation
- Vector commitments over rings and compressed -protocols
- Doubly efficient interactive proofs over infinite and non-commutative rings
- How to prove statements obliviously?
- Verifiable computation for approximate homomorphic encryption schemes
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- Cryptanalysis on lightweight verifiable homomorphic encryption
- Verifiable FHE via lattice-based SNARKs
- Blind zkSNARKs for private proof delegation and verifiable computation over encrypted data
This page was built for publication: Flexible and efficient verifiable computation on encrypted data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061972)
