Catching MPC Cheaters: Identification and Openability-Reference-Cited by-同舟云学术

Catching MPC Cheaters: Identification and Openability

Published:2017 Issue: Volume: Page:110-134
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cunningham Robert,Fuller Benjamin,Yakoubov Sophia

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-72089-0_7

Reference29 articles.

1. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on Bitcoin. Commun. ACM 59(4), 76–84 (2016)

2. Lecture Notes in Computer Science;C Baum,2014

3. Baum, C., Orsini, E., Scholl, P.: Efficient secure multiparty computation with identifiable abort. Cryptology ePrint Archive, Report 2016/187 (2016). http://eprint.iacr.org/2016/187

4. Lecture Notes in Computer Science;D Beaver,1992

5. Lecture Notes in Computer Science;P Bogetoft,2009

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

1. Secure Multiparty Computation with Identifiable Abort via Vindicating Release;Lecture Notes in Computer Science;2024

2. Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs;Lecture Notes in Computer Science;2024

3. Efficient Decision-Making Scheme Using Secure Multiparty Computation with Correctness Validation;Electronics;2023-11-30

4. AUC: Accountable Universal Composability;2023 IEEE Symposium on Security and Privacy (SP);2023-05

5. Secure Multiparty Computation with Identifiable Abort and Fairness;2023 7th International Conference on Cryptography, Security and Privacy (CSP);2023-04