Asymptotically-Good Arithmetic Secret Sharing over Z/pℓZ with Strong Multiplication and Its Applications to Efficient MPC - Archive ouverte HAL Access content directly
Book Sections Year : 2021
Not file

Dates and versions

hal-03800642 , version 1 (06-10-2022)

Identifiers

Cite

Ronald Cramer, Matthieu Rambaud, Chaoping Xing. Asymptotically-Good Arithmetic Secret Sharing over Z/pℓZ with Strong Multiplication and Its Applications to Efficient MPC. Advances in Cryptology – CRYPTO 2021, 12827, Springer International Publishing, pp.656-686, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-84252-9_22⟩. ⟨hal-03800642⟩
6 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More