Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
From MaRDI portal
Publication:2306905
DOI10.1007/s10623-019-00704-yzbMath1454.94108OpenAlexW2993230732WikidataQ126558471 ScholiaQ126558471MaRDI QIDQ2306905
Liang Feng Zhang, Reihaneh Safavi-Naini
Publication date: 27 March 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00704-y
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- 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
- 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
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Signatures of Correct Computation
- Algebraic (Trapdoor) One-Way Functions and Their Applications
- 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
- Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
- Oblivious Polynomial Evaluation
This page was built for publication: Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions