Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC
- 11 August 2021
- book chapter
- Published by Springer Nature
- p. 656-686
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite FieldLecture Notes in Computer Science, 2009
- Perfectly-Secure MPC with Linear Communication Complexity2008
- Linear algebra algorithms for divisors on an algebraic curveMathematics of Computation, 2003
- Computing Riemann–Roch Spaces in Algebraic Function Fields and Related TopicsJournal of Symbolic Computation, 2002
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov boundIEEE Transactions on Information Theory, 2001
- Algebraic geometric codes over ringsJournal of Pure and Applied Algebra, 1999
- List decoding of algebraic-geometric codesIEEE Transactions on Information Theory, 1999
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Modular andp-adic cyclic codesDesigns, Codes and Cryptography, 1995