Improved single-round secure multiplication using regenerating codes

DOI10.1007/978-3-030-92075-3_8MaRDI QIDQ6157517zbMATH OpenOpenAlexFDO

Authors M. Abspoel, Ronald Cramer, Daniel E. Escudero, Ivan B. Damgård, Chaoping Xing

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92075-3_8

zbMATH Keywords

Galois ringsShamir's secret-sharing scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Recommendations

• Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
• Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
• Efficient information-theoretic multi-party computation over non-commutative rings
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Atomic Secure Multi-party Multiplication with Low Communication

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Amortized complexity of information-theoretically secure MPC revisited
• Communication lower bounds for statistically secure MPC, with or without preprocessing
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
• Fluid MPC: secure multiparty computation with dynamic participants
• Honest majority MPC with abort with minimal online communication
• scientific article; zbMATH DE number 2002850 (Why is no real title available?)
• On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
• On the local leakage resilience of linear secret sharing schemes
• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• Repairing Reed-solomon codes
• Repairing Reed-Solomon Codes
• Scalable and Unconditionally Secure Multiparty Computation
• Secure multiparty computation and secret sharing
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing

Cited in

(5)

• Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
• On interactive oracle proofs for Boolean R1CS statements
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
• More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
• Perfectly-secure multiparty computation with linear communication complexity over any modulus

This page was built for publication: Improved single-round secure multiplication using regenerating codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157517)