Arithmetic sketching (Q6186591): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4228450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bound for Linear Sketches of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hunting of the SNARK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge proofs on secret-shared data via fully linear PCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Targeted malleability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function secret sharing for mixed-mode and fixed-point secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved data stream summary: the count-min sketch and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact zero-knowledge proofs of small Hamming weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight, maliciously secure verifiable function secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multiparty computation of approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits resilient to additive attacks with applications to secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local decision test for sparse polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Zero-Knowledge Arguments for Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private multiparty sampling and approximation of vector combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of addition / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:31, 26 August 2024

scientific article; zbMATH DE number 7799094
Language Label Description Also known as
English
Arithmetic sketching
scientific article; zbMATH DE number 7799094

    Statements

    Arithmetic sketching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    low-communication zero-knowledge verification of secret-shared vectors
    0 references
    lightweight protocols
    0 references

    Identifiers

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