Reusable Two-Round MPC from LPN-Reference-Cited by-同舟云学术

Reusable Two-Round MPC from LPN

Published:2022 Issue: Volume: Page:165-193
ISSN:0302-9743
Container-title:Public-Key Cryptography – PKC 2022
language:
Short-container-title:

Author:

Bartusek James,Garg Sanjam,Srinivasan Akshayaram,Zhang Yinuo

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-97121-2_7

Reference24 articles.

1. Applebaum, B., Harnik, D., Ishai, Y.: Semantic security under related-key attacks and applications. In: Chazelle, B. (ed.) ICS 2011, pp. 45–60. Tsinghua University Press, January 2011

2. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications (extended abstract). In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), pp. 260–274 (2005)

3. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. J. Cryptol. 22(4), 429–469 (2009)

4. Lecture Notes in Computer Science;P Ananth,2020

5. Boyle, E.: Efficient two-round OT extension and silent non-interactive secure computation. In: ACM CCS 19, pp. 291–308. ACM Press (2019)

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

1. Malicious Security for SCALES;Lecture Notes in Computer Science;2024

2. mrNISC from LWE with polynomial modulus;Information and Computation;2023-08

3. Maliciously-Secure MrNISC in the Plain Model;Advances in Cryptology – EUROCRYPT 2023;2023

4. Reusable Secure Computation in the Plain Model;Advances in Cryptology – CRYPTO 2023;2023

5. Statistically Sender-Private OT from LPN and Derandomization;Advances in Cryptology – CRYPTO 2022;2022