Efficient Two Party and Multi Party Computation Against Covert Adversaries-Reference-Cited by-同舟云学术

Efficient Two Party and Multi Party Computation Against Covert Adversaries

Published: Issue: Volume: Page:289-306
ISSN:
Container-title:Advances in Cryptology – EUROCRYPT 2008
language:
Short-container-title:

Author:

Goyal Vipul,Mohassel Payman,Smith Adam

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78967-3_17.pdf

Reference23 articles.

1. Lecture Notes in Computer Science;Y. Aumann,2007

2. Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS, pp. 345–355. IEEE Computer Society Press, Los Alamitos (2002)

3. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503–513. ACM Press, New York (1990)

4. Ben-Or, M., Goldwasser, S., Widgerson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of ACM STOC, pp. 1–10 (1988)

5. Chaum, D., Crepeau, C., Damgard, I.: Multi-party unconditionally secure protocols. In: Proceedings of ACM STOC, pp. 11–19 (1988)

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

1. Efficient Verifiable Cloud-Assisted PSI Cardinality for Privacy-Preserving Contact Tracing;IEEE Transactions on Cloud Computing;2024-01

2. Rational Broadcast Protocols Against Timid Adversaries;Lecture Notes in Computer Science;2023

3. Robust Publicly Verifiable Covert Security: Limited Information Leakage and Guaranteed Correctness with Low Overhead;Advances in Cryptology – ASIACRYPT 2023;2023

4. Developing non-interactive MPC with trusted hardware for enhanced security;International Journal of Information Security;2022-03-07

5. Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC;Applied Cryptography and Network Security;2022