Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905): 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: 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: Q4231909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory Delegation / 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: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes / 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: Homomorphic Authenticated Encryption Secure against Chosen-Ciphertext Attack / 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: 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

Revision as of 03:37, 22 July 2024

scientific article
Language Label Description Also known as
English
Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
scientific article

    Statements

    Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (English)
    0 references
    0 references
    0 references
    27 March 2020
    0 references
    verifiable computation
    0 references
    public delegation
    0 references
    public verification
    0 references
    data privacy
    0 references
    0 references
    0 references
    0 references

    Identifiers