Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing-Reference-Cited by-同舟云学术

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

Published:2019 Issue: Volume: Page:61-84
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2019
language:
Short-container-title:

Author:

Damgård Ivan,Larsen Kasper Green,Nielsen Jesper Buus

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-26951-7_3

Reference20 articles.

1. Blundo, C., De Santis, A., Persiano, G., Vaccaro, U.: Randomness complexity of private computation. Comput. Complex. 8(2), 145–168 (1999)

2. Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143–202 (2000)

3. Lecture Notes in Computer Science;I Cascudo,2018

4. Chor, B., Kushilevitz, E.: A communication-privacy tradeoff for modular addition. Inf. Process. Lett. 45(4), 205–210 (1993)

5. Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. Cryptology ePrint Archive, Report 2018/465 (2018)

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

1. Scalable Multiparty Computation from Non-linear Secret Sharing;Lecture Notes in Computer Science;2024

2. TurboPack;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07

3. Optimal-round preprocessing-MPC of polynomials over non-zero inputs via distributed random matrix;Wireless Networks;2022-07-05

4. Limits of Polynomial Packings for $$\mathbb {Z}_{p^k}$$ and $$\mathbb {F}_{p^k}$$;Advances in Cryptology – EUROCRYPT 2022;2022

5. On Interactive Oracle Proofs for Boolean R1CS Statements;Financial Cryptography and Data Security;2022