Improved single-round secure multiplication using regenerating codes
From MaRDI portal
Publication:6157517
DOI10.1007/978-3-030-92075-3_8OpenAlexW3157574080MaRDI QIDQ6157517
M. Abspoel, Ronald Cramer, Xing, Chaoping, Daniel E. Escudero, Ivan B. Damgård
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
Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
On interactive oracle proofs for Boolean R1CS statements ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
Cites Work
- Unnamed Item
- Amortized complexity of information-theoretically secure MPC revisited
- Fluid MPC: secure multiparty computation with dynamic participants
- Honest majority MPC with abort with minimal online communication
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Scalable and Unconditionally Secure Multiparty Computation
- Repairing Reed-Solomon Codes
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Advances in Cryptology - EUROCRYPT 2004
- On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
- Repairing Reed-solomon codes
- Secure Multiparty Computation and Secret Sharing
- On the local leakage resilience of linear secret sharing schemes
This page was built for publication: Improved single-round secure multiplication using regenerating codes
