On the Message Complexity of Secure Multiparty Computation-Reference-Cited by-同舟云学术

On the Message Complexity of Secure Multiparty Computation

Published:2018 Issue: Volume: Page:698-711
ISSN:0302-9743
Container-title:Public-Key Cryptography – PKC 2018
language:
Short-container-title:

Author:

Ishai Yuval,Mittal Manika,Ostrovsky Rafail

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-76578-5_24

Reference24 articles.

1. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in $$NC^0$$. In: FOCS, pp. 166–175 (2004)

2. Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Proceedings of CCS 2012, Raleigh, NC, USA, 16–18 October 2012, pp. 784–796 (2012)

3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1–10 (1988)

4. Benhamouda, F., Lin, H.: k-round MPC from k-round ot via garbled interactive circuits. Cryptology ePrint Archive, Report 2017/1125 (2017). https://eprint.iacr.org/2017/1125

5. Lecture Notes in Computer Science;E Boyle,2015

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

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

2. Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More;Theory of Cryptography;2020

3. Privacy-Preserving Analysis of Distributed Biomedical Data: Designing Efficient and Secure Multiparty Computations Using Distributed Statistical Learning Theory;JMIR Medical Informatics;2019-04-29

4. A novel approach to public-coin concurrent zero-knowledge and applications on resettable security;Science China Information Sciences;2019-01-29

5. The Broadcast Message Complexity of Secure Multiparty Computation;Lecture Notes in Computer Science;2019