Round Efficiency of Multi-party Computation with a Dishonest Majority-Reference-Cited by-同舟云学术

Round Efficiency of Multi-party Computation with a Dishonest Majority

Published:2003 Issue: Volume: Page:578-595
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Katz Jonathan,Ostrovsky Rafail,Smith Adam

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-39200-9_36

Reference34 articles.

1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In Eighth ACM Symposium on Principles of Distributed Computing, pages 201–209, 1989.

2. B. Barak. Constant-round coin-tossing with a man in the middle. In 43rd IEEE Symposium on the Foundations of Computer Science, 2002. References are to the preliminary full version, available from the author’s web page.

3. B. Barak and O. Goldreich. Universal arguments of knowledge. In 17th IEEE Conference on Computational Complexity, pages 194–203, 2002.

4. Lect Notes Comput Sci;D. Beaver,1991

5. Lect Notes Comput Sci;D. Beaver,1989

Cited by 43 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. A New Approach to Post-Quantum Non-Malleability;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Maliciously-Secure MrNISC in the Plain Model;Advances in Cryptology – EUROCRYPT 2023;2023

4. A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem;Lecture Notes in Computer Science;2023

5. List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing;Advances in Cryptology – CRYPTO 2023;2023