More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Daniel Escudero 0001, Chaoping Xing, Chen Yuan 0003. More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. In Yevgeniy Dodis, Thomas Shrimpton, editors, Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I. Volume 13507 of Lecture Notes in Computer Science, pages 383-412, Springer, 2022. [doi]

This author has not been identified. Look up 'Daniel Escudero 0001' in GoogleThis author has not been identified. Look up 'Chaoping Xing' in GoogleThis author has not been identified. Look up 'Chen Yuan 0003' in Google

runs on WebDSL