On the Communication Required for Unconditionally Secure Multiplication (Q2829225): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4279564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness complexity of private computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly-Secure MPC with Linear Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409124 / 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: Scalable Multiparty Computation with Nearly Optimal Work and Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable and Unconditionally Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Communication Complexity of Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal model for secure computation (extended abstract) / 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: Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the amount of randomness in private computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Correlated Randomness in Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Arithmetic Computation with No Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness in Private Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication preserving protocols for secure function evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Practical Active-Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Efficiency of Classical and Quantum Oblivious Transfer Reductions / rank
 
Normal rank

Latest revision as of 20:27, 12 July 2024

scientific article
Language Label Description Also known as
English
On the Communication Required for Unconditionally Secure Multiplication
scientific article

    Statements

    On the Communication Required for Unconditionally Secure Multiplication (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references