Cryptography Help making Secure Multiparty Computation Byzantine Fault Tolerant

---

Help making Secure Multiparty Computation Byzantine Fault Tolerant Posted: 27 Sep 2018 03:43 PM PDT I've got the basics of SMPC down thanks to this very helpful video: https://www.youtube.com/watch?v=_mDlLKgiFDY They mention some shortcomings near the end of the video around the fault-tolerance of the participating node. They say something like SMPC is fault-tolerant up to f = n/3 and that it's fault-tolerant up to f = n/2 using cryptographic signature. ​ Are there any resources out there regarding the BFT of SMPC? I'm making my way through this proof of BGW SMPC here (https://eprint.iacr.org/2011/136.pdf), but it's pretty heavy reading and 90 pages long. Can someone help me understand how to make these algorithms fault-tolerant? submitted by /u/ZZShark9 [link] [comments]

You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States