From 5665c733b010eae1f9bbb12d28e872e2f5b10276 Mon Sep 17 00:00:00 2001 From: Jonah Aragon Date: Mon, 15 Sep 2025 12:11:08 -0500 Subject: [PATCH] Add comma --- blog/posts/multi-party-computation.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/blog/posts/multi-party-computation.md b/blog/posts/multi-party-computation.md index 23a136b9..87fceac5 100644 --- a/blog/posts/multi-party-computation.md +++ b/blog/posts/multi-party-computation.md @@ -32,7 +32,7 @@ This early scheme is highly specialized for this task and not applicable to diff Alice and Bob have struck it rich! They're both millionaires, but they want to be able to see who has more money without revealing exactly how much they have to each other. -Luckily, we can use **Multi-Party Computation** (**MPC**) to solve this "Millionaire's Problem," using a method invented by Andrew Yao called *garbled circuits*. Garbled circuits allow us to use MPC for any problem as long as it can be represented as a boolean circuit i.e. a set of logic gates such as `AND` `OR` `XOR` etc. +Luckily, we can use **Multi-Party Computation** (**MPC**) to solve this "Millionaire's Problem," using a method invented by Andrew Yao called *garbled circuits*. Garbled circuits allow us to use MPC for any problem as long as it can be represented as a boolean circuit, i.e. a set of logic gates such as `AND` `OR` `XOR` etc. ### Garbled Circuits