Flexible and efficient verifiable computation on encrypted data
From MaRDI portal
Publication:2061972
DOI10.1007/978-3-030-75248-4_19OpenAlexW3030708022MaRDI QIDQ2061972
Dario Fiore, Dongwoo Kim, Alexandre Bois, Ignacio Cascudo
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_19
Related Items (6)
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 \(\varSigma \)-protocols ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings
Cites Work
- Unnamed Item
- Unnamed Item
- Homomorphic lower digits removal and improved FHE bootstrapping
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Boosting verifiable computation on encrypted data
- Aurora: transparent succinct arguments for R1CS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- Practical verified computation with streaming interactive proofs
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Time-Optimal Interactive Proofs for Circuit Evaluation
- How to Run Turing Machines on Encrypted Data
- Modern Computer Algebra
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Interactive Oracle Proofs
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Fiat-Shamir: from practice to theory
This page was built for publication: Flexible and efficient verifiable computation on encrypted data
