When you talk about NPCs, they are often combined with or compared to some other encryption ideas. Fully homomorphic encryption is where you can encrypt something but still retain a domain of functionality over it. So let's stick with a simple example of addition again. You want to encrypt the number of six and then send that out to people. Then someone wants to add something to this number, but they don't know what the number or what the original number is.
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