From FE Combiners to Secure MPC and Back-Reference-Cited by-同舟云学术

From FE Combiners to Secure MPC and Back

Published:2019 Issue: Volume: Page:199-228
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Ananth Prabhanjan,Badrinarayanan Saikrishna,Jain Aayush,Manohar Nathan,Sahai Amit

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-36030-6_9

Reference79 articles.

1. Agrawal, S.: New Methods for Indistinguishability Obfuscation: Bootstrapping and Instantiation. Cryptology ePrint Archive, Report 2018/633 (2018). https://eprint.iacr.org/2018/633

2. Lecture Notes in Computer Science;S Agrawal,2013

3. Lecture Notes in Computer Science;P Ananth,2015

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

5. Ananth, P., Jain, A., Khurana, D., Sahai, A.: Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. Cryptology ePrint Archive, Report 2018/615 (2018). https://eprint.iacr.org/2018/615

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

1. Adaptively Secure MPC with Sublinear Communication Complexity;Journal of Cryptology;2023-03-22

2. Indistinguishability Obfuscation from LPN over $$\mathbb {F}_p$$, DLIN, and PRGs in NC$$^0$$;Advances in Cryptology – EUROCRYPT 2022;2022

3. Round-Optimal and Communication-Efficient Multiparty Computation;Advances in Cryptology – EUROCRYPT 2022;2022

4. Comparison-based MPC in Star Topology;Proceedings of the 19th International Conference on Security and Cryptography;2022

5. On the Bottleneck Complexity of MPC with Correlated Randomness;Public-Key Cryptography – PKC 2022;2022