Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A full proof of the BGW protocol for perfectly secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness complexity of private computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-One Law for Boolean Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A communication-privacy tradeoff for modular addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditionally Secure Computation with Reduced Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Communication Required for Unconditionally Secure Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication and Randomness Lower Bounds for Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Sensitivity and Applications in Private Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness in Private Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing linear size circuits in terms of privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortizing Randomness in Private Multiparty Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomness-Rounds Tradeoff in Private Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting randomness: A survey and new constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090444 / rank
 
Normal rank

Latest revision as of 13:22, 22 July 2024

scientific article
Language Label Description Also known as
English
Lower and upper bounds on the randomness complexity of private computations of AND
scientific article

    Statements

    Lower and upper bounds on the randomness complexity of private computations of AND (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    multi-party information-theoretic private protocols
    0 references

    Identifiers