A New Approach to Round-Optimal Secure Multiparty Computation-Reference-Cited by-同舟云学术

A New Approach to Round-Optimal Secure Multiparty Computation

Published:2017 Issue: Volume: Page:468-499
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2017
language:
Short-container-title:

Author:

Ananth Prabhanjan,Choudhuri Arka Rai,Jain Abhishek

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-63688-7_16

Reference42 articles.

1. Ananth, P., Choudhuri, A.R., Jain, A.: A new approach to round-optimal secure multiparty computation. IACR Cryptology ePrint Archive 2017, 402 (2017). http://eprint.iacr.org/2017/402

2. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Comput. Complex. 15(2), 115–162 (2006)

3. Lecture Notes in Computer Science;G Asharov,2012

4. Lecture Notes in Computer Science;B Barak,2001

5. Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Berkeley, California, USA, Proceedings, 21–24 October 2006, pp. 345–354 (2006)

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

1. Cloud-SMPC: two-round multilinear maps secure multiparty computation based on LWE assumption;Journal of Cloud Computing;2024-01-22

2. The Round Complexity of Statistical MPC with Optimal Resiliency;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. On Non-uniform Security for Black-Box Non-interactive CCA Commitments;Advances in Cryptology – EUROCRYPT 2023;2023

4. Two-Round Concurrent 2PC from Sub-exponential LWE;Advances in Cryptology – ASIACRYPT 2023;2023

5. Broadcast-Optimal Four-Round MPC in the Plain Model;Theory of Cryptography;2023