Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory of Cryptography / 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: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized complexity of information-theoretically secure MPC revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation and Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435447 / rank
 
Normal rank

Latest revision as of 14:20, 22 July 2024

scientific article
Language Label Description Also known as
English
Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
scientific article

    Statements

    Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    linear secret sharing
    0 references
    randomizing polynomials
    0 references
    multiplicative span programs
    0 references
    secure multi-party computation
    0 references

    Identifiers

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