Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
From MaRDI portal
Publication:2691584
DOI10.1007/978-3-030-64840-4_6MaRDI QIDQ2691584
Matthieu Rambaud, M. Abspoel, Chen Yuan, Ronald Cramer, Ivan B. Damgård, Xing, Chaoping, Daniel E. Escudero
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_6
Related Items
Sharing transformation and dishonest majority MPC with packed secret sharing, More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings, Sumcheck arguments and their applications, Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
Cites Work
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Amortized complexity of information-theoretically secure MPC revisited
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Guaranteed output delivery comes free in honest majority MPC
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Communication-efficient unconditional MPC with guaranteed output delivery
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Algebraic Function Fields and Codes
- Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound
- Scalable and Unconditionally Secure Multiparty Computation
- The Byzantine generals problem
- Circuits resilient to additive attacks with applications to secure computation
- Secure Computation from Random Error Correcting Codes
- Perfectly-Secure MPC with Linear Communication Complexity
- Theory of Cryptography
