Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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-64840-4_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3111032938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings / rank
 
Normal rank
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: Zero-knowledge proofs on secret-shared data via fully linear PCPs / 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: Secure Computation from Random Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast large-scale honest-majority MPC for malicious adversaries / 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: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication lower bounds for statistically secure MPC, with or without preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable and Unconditionally Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound / 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: Communication-efficient unconditional MPC with guaranteed output delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed output delivery comes free in honest majority MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising communication in honest-majority MPC by batchwise multiplication verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Function Fields and Codes / rank
 
Normal rank

Latest revision as of 19:13, 31 July 2024

scientific article
Language Label Description Also known as
English
Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
scientific article

    Statements

    Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2023
    0 references
    0 references
    0 references
    0 references

    Identifiers