From ed55bb9157537b1f1a03a90a2344853c59c1def9 Mon Sep 17 00:00:00 2001 From: nglaeser Date: Thu, 7 Jul 2022 09:54:14 -0700 Subject: [PATCH] update packet blurb --- packet/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/packet/README.md b/packet/README.md index ccf0f26..f69681d 100644 --- a/packet/README.md +++ b/packet/README.md @@ -5,4 +5,4 @@ - **[Answers](answers.pdf)** ([source](answers.tex)). Black-and-white version [here](answers-bw.pdf). - **[Jupyter Notebook](https://colab.research.google.com/drive/18NxRFaAb3H65EaUUPwlHN7pQFXYvsy6n?usp=sharing)** ([source](../spring/ShamirSS.ipynb)): Jupyter notebook for interactive portion; currently links to the spring event version. -> In this problem set, you will learn how to use math to share a secret among a group of people so that they have to work together to learn the secret. This is the cryptographic technique known as secret sharing and is one of the fundamental building blocks of secure multi-party computation, or MPC. MPC is used by many companies like Amazon, Google, and the cryptocurrency Zcash to do computations over secret or private data. This makes MPC incredibly versatile, since it can do anything from allowing hospitals to improve the accuracy of their diagnoses by pooling their private medical data without ever revealing it, to enabling a large-scale analysis of the gender pay gap by computing over private salary data (an example we discuss in the packet). Since most MPC is based on secret sharing, you’ll learn an important building block and see firsthand how cryptography lets us achieve seemingly impossible things. As a bonus, you can even try your hand at writing a mathematical proof of security, thereby learning techniques that cryptographers everywhere use to mathematically guarantee the security and privacy of our online infrastructure. \ No newline at end of file +> In this problem set, you will learn how to use math to share a secret among a group of people so that they have to work together to learn the secret. This is the cryptographic technique known as secret sharing and is one of the fundamental building blocks of secure multi-party computation, or MPC, which is used by companies like Amazon, Google, and the cryptocurrency Zcash to do computations over private data. The math used in secret sharing is probability and polynomial interpolation, the latter of which is based on concepts you are probably very familiar with from your school curriculum. In this packet, you'll see firsthand how we can use these simple building blocks to achieve seemingly impossible things. As a bonus, you can even try your hand at writing a mathematical proof of security, thereby learning techniques that cryptographers everywhere use to mathematically guarantee the security and privacy of our online infrastructure. \ No newline at end of file