Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography-Reference-Cited by-同舟云学术

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

Published:2010 Issue: Volume: Page:445-465
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2010
language:
Short-container-title:

Author:

Damgård Ivan,Ishai Yuval,Krøigaard Mikkel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13190-5_23.pdf

Reference29 articles.

1. Lecture Notes in Computer Science;B. Applebaum,2009

2. Lecture Notes in Computer Science;Z. Beerliová-Trubíniová,2008

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

4. Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Short pcps verifiable in polylogarithmic time. In: IEEE Conference on Computational Complexity, pp. 120–134. IEEE Computer Society, Los Alamitos (2005)

5. Benes, V.E.: Optimal rearrangable multistage connecting networks. The Bell System Technical Journal 43, 1641–1656 (1964)

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

1. On the Communication Complexity of Secure Multi-Party Computation With Aborts;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Optimal Load-Balanced Scalable Distributed Agreement;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. MPC-in-the-Head Framework without Repetition and its Applications to the Lattice-based Cryptography;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

4. Perfect Asynchronous MPC with Linear Communication Overhead;Lecture Notes in Computer Science;2024

5. Leakage-Tolerant Circuits;Lecture Notes in Computer Science;2024