On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214685902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From FE combiners to secure MPC and back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Interactive Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Locality in Secure Multi-party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obfuscation of Probabilistic Circuits and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the communication complexity of multiparty computation in the correlated randomness model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation with Low Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Secure Multiparty Computation / 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: On the Communication Required for Unconditionally Secure Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure massively parallel computation for dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation with General Interaction Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best possible information-theoretic MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation on the Web: Computing without Simultaneous Interaction / 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: On the message complexity of secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Branching Programs on Encrypted Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hiding the Input-Size in Secure Two-Party Computation / 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: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank

Latest revision as of 14:47, 29 July 2024

scientific article; zbMATH DE number 7554912
Language Label Description Also known as
English
On the Bottleneck Complexity of MPC with Correlated Randomness
scientific article; zbMATH DE number 7554912

    Statements

    On the Bottleneck Complexity of MPC with Correlated Randomness (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2022
    0 references
    0 references
    bottleneck complexity of a secure multi-party computation protocol
    0 references
    0 references
    0 references