Multi-server verifiable delegation of computations: unconditional security and practical efficiency
type: Item
instance of: scholarly article
title: Multi-server verifiable delegation of computations: unconditional security and practical efficiency
author: Liang Feng Zhang
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2104.12331
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433288
zbMATH Keywords: delegation of computation
zbMATH Keywords: verifiable computation
zbMATH Keywords: input privacy
zbMATH Keywords: function privacy
describes a project that uses: Pinocchio
MaRDI profile type: Publication
OpenAlex ID: W3135268205
cites work: Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
cites work: From Secrecy to Soundness: Efficient Verification via Secure Computation
cites work: Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation
cites work: Q4536794
cites work: Verifiable Delegation of Computation over Large Datasets
cites work: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
cites work: Two Protocols for Delegation of Computation
cites work: Practical Homomorphic MACs for Arithmetic Circuits
cites work: Algebraic (Trapdoor) One-Way Functions and Their Applications
cites work: Q4231909
cites work: Memory Delegation
cites work: Improved Delegation of Computation Using Fully Homomorphic Encryption
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Fully homomorphic encryption using ideal lattices
cites work: Q3549691
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Leveled Fully Homomorphic Signatures from Standard Lattices
cites work: Homomorphic Authenticated Encryption Secure against Chosen-Ciphertext Attack
cites work: Q4343444
cites work: Linearly Homomorphic Structure-Preserving Signatures and Their Applications
cites work: Signatures of Correct Computation
cites work: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
cites work: Time-Optimal Interactive Proofs for Circuit Evaluation
DOI: 10.1016/J.IC.2021.104740
description: scientific article; zbMATH DE number 7433288