Multi-server verifiable delegation of computations: unconditional security and practical efficiency
From MaRDI portal
Publication:2051777
DOI10.1016/j.ic.2021.104740OpenAlexW3135268205MaRDI QIDQ2051777
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.12331
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Homomorphic Authenticated Encryption Secure against Chosen-Ciphertext Attack
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- The Knowledge Complexity of Interactive Proof Systems
- Signatures of Correct Computation
- Algebraic (Trapdoor) One-Way Functions and Their Applications
- Practical Homomorphic MACs for Arithmetic Circuits
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fully homomorphic encryption using ideal lattices
- Verifiable Delegation of Computation over Large Datasets
- Memory Delegation
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Two Protocols for Delegation of Computation
- Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
This page was built for publication: Multi-server verifiable delegation of computations: unconditional security and practical efficiency
