Boosting verifiable computation on encrypted data
type: Item
instance of: scholarly article
title: Boosting verifiable computation on encrypted data
DOI: 10.1007/978-3-030-45388-6_5
author: Dario Fiore
author: Anca Nitulescu
author: David Pointcheval
publication date: 2021-12-01T00:00:00Z
full work available at URL: 2020-132.pdf
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436970
describes a project that uses: LegoSNARK
MaRDI profile type: Publication
OpenAlex ID: W3023051856
cites work: Q4230321
cites work: Short signatures without random oracles and the SDH assumption in bilinear groups
cites work: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: Arya: nearly linear-time zero-knowledge proofs for correct program execution
cites work: Aurora: transparent succinct arguments for R1CS
cites work: Q4318711
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Knowledge-Binding Commitments with Applications in Time-Stamping
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
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: Practical verified computation with streaming interactive proofs
cites work: Q4035738
cites work: FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
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: The knowledge complexity of interactive proof-systems
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: Constant-Size Commitments to Polynomials and Their Applications
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
cites work: Security arguments for digital signatures and blind signatures
cites work: Signatures of Correct Computation
cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
cites work: Libra: succinct zero-knowledge proofs with optimal prover computation
description: scientific article; zbMATH DE number 7436970