Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Secrecy to Soundness: Efficient Verification via Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifiable Delegation of Computation over Large Datasets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic (Trapdoor) One-Way Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Client Non-interactive Verifiable Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Delegation of Computation Using Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory Delegation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing curves in three (and higher) dimensional space from noisy data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Run Turing Machines on Encrypted Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit capacity-achieving list-decodable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Authenticated Encryption Secure against Chosen-Ciphertext Attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly Homomorphic Structure-Preserving Signatures and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Polynomial Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signatures of Correct Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of Reed Solomon codes beyond the error-correction bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious evaluation of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Information-Theoretic Private Information Retrieval / rank
 
Normal rank

Revision as of 15:48, 25 July 2024

scientific article
Language Label Description Also known as
English
Privacy-preserving verifiable delegation of polynomial and matrix functions
scientific article

    Statements

    Privacy-preserving verifiable delegation of polynomial and matrix functions (English)
    0 references
    0 references
    0 references
    3 May 2021
    0 references
    cloud computing
    0 references
    outsourcing computation
    0 references
    verifiable computation
    0 references
    privacy preservation
    0 references
    polynomials
    0 references
    matrices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references