When you talk about basic NPCs, you're definitely talking about a combination of polynomials. They're basically something like, if you've ever seen a function with like five plus three x plus x squared plus something x cubed, that's a polynomial. And these functions actually do make up the basis of NPC as far as we can tell. So let's talk a little bit about how to do secret sharing with just basic polynomial and sort of how that works.
In this week's episode, Anna and Fredrik give a general introduction to MPCs, go over a few examples of MPCs in action, compare them with other cryptographic concepts, try to pronounce "fully homomorphic encryption" properly, and more!
Here are some of the material that we reference:
Thanks again to this week's sponsor Aragon.
To find out more about Aracon, the first Aragon community conference happening on January 29-30th in Berlin visit aracon.one
To the listeners of Zero Knowledge Podcast, if you like what we do:
Follow us on Twitter - @zeroknowledgefm
Join us on Telegram - https://t.me/joinchat/B_81tQ57-ThZg8yOSx5gjA
Support us on Patreon - https://www.patreon.com/zeroknowledge
Or directly here:
ETH: 0xC0FFEE1B5083230a5154F55f253B6b6ae8F29B1a
BTC: 1cafekGa3podM4fBxPSQc6RCEXQNTK8Zz