Privacy-preserving verifiable delegation of polynomial and matrix functions

DOI10.1515/jmc-2018-0039zbMath1503.68072OpenAlexW2979943645MaRDI QIDQ2023805

Liang Feng Zhang, Reihaneh Safavi-Naini

Publication date: 3 May 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2018-0039

zbMATH Keywords

polynomialsmatricescloud computingprivacy preservationverifiable computationoutsourcing computation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Internet topics (68M11) Privacy of data (68P27)

Uses Software

• Pinocchio

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decoding of Reed Solomon codes beyond the error-correction bound
• Oblivious evaluation of multivariate polynomials
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• How to Run Turing Machines on Encrypted Data
• Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• Explicit capacity-achieving list-decodable codes
• Homomorphic Authenticated Encryption Secure against Chosen-Ciphertext Attack
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• Reconstructing curves in three (and higher) dimensional space from noisy data
• 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
• Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes
• The Knowledge Complexity of Interactive Proof Systems
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Signatures of Correct Computation
• Multi-Client Non-interactive Verifiable Computation
• Algebraic (Trapdoor) One-Way Functions and Their Applications
• Verifiable Delegation of Computation over Large Datasets
• Memory Delegation
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
• Oblivious Polynomial Evaluation

This page was built for publication: Privacy-preserving verifiable delegation of polynomial and matrix functions