Flexible and efficient verifiable computation on encrypted data
type: Item
instance of: scholarly article
title: Flexible and efficient verifiable computation on encrypted data
DOI: 10.1007/978-3-030-75248-4_19
author: Alexandre Bois
author: Ignacio Cascudo
author: Dario Fiore
author: Dongwoo Kim
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450217
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 19
OpenAlex ID: W3030708022
cites work: Aurora: transparent succinct arguments for R1CS
cites work: Interactive Oracle Proofs
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
cites work: Fiat-Shamir: from practice to theory
cites work: Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
cites work: Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
cites work: Homomorphic lower digits removal and improved FHE bootstrapping
cites work: Marlin: preprocessing zkSNARKs with universal and updatable SRS
cites work: Homomorphic encryption for arithmetic of approximate numbers
cites work: Practical verified computation with streaming interactive proofs
cites work: FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
cites work: Boosting verifiable computation on encrypted data
cites work: Fully homomorphic encryption using ideal lattices
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: How to Run Turing Machines on Encrypted Data
cites work: Q3549691
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
cites work: Fully homomorphic SIMD operations
cites work: Time-Optimal Interactive Proofs for Circuit Evaluation
cites work: Modern computer algebra
cites work: Q4435447
cites work: Libra: succinct zero-knowledge proofs with optimal prover computation
description: scientific article; zbMATH DE number 7450217