MPC for $$\mathcal {Q}_2$$ Access Structures over Rings and Fields-Reference-Cited by-同舟云学术

MPC for $$\mathcal {Q}_2$$ Access Structures over Rings and Fields

Published:2022 Issue: Volume: Page:131-151
ISSN:0302-9743
Container-title:Selected Areas in Cryptography
language:
Short-container-title:

Author:

Jadoul Robin^ORCID,Smart Nigel P.^ORCID,Van Leeuwen Barry^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-99277-4_7

Reference17 articles.

1. Abspoel, M., et al.: Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over $$\mathbb{Z}/p^k\mathbb{Z}$$. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 151–180. Springer, Heidelberg, December 2020

2. Abspoel, M., Dalskov, A., Escudero, D., Nof, A.: An efficient passive-to-active compiler for honest-majority MPC over rings. Cryptology ePrint Archive, Report 2019/1298 (2019). https://eprint.iacr.org/2019/1298

3. Araki, T., et al.: Optimized honest-majority MPC for malicious adversaries - breaking the 1 billion-gate per second barrier. In: 2017 IEEE Symposium on Security and Privacy, pp. 843–862. IEEE Computer Society Press, May 2017

4. Lecture Notes in Computer Science;D Bogdanov,2008

5. Lecture Notes in Computer Science;K Chida,2018

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience;Journal of Cryptology;2024-06-06

2. ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for $$\mathbb {Z}_{2^k}$$;Cryptography and Coding;2023-12-04

3. Noah's Ark: Efficient Threshold-FHE Using Noise Flooding;Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography;2023-11-26