Explore >> Select a destination
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
vitalik.eth.limo
|
|
| | | | | ||
| | | | |
theorydish.blog
|
|
| | | | | In this post, we'll discuss how Galois rings (a recent algebraic structure) improve the communication complexity of dishonest multiparty computation (MPC) protocols.Before we dive into MPC, I'll take a brief detour to discuss how computation is usually modeled in cryptography. When cryptographers think about computation, they often think about circuits comprised of addition and multiplication... | |
| | | | |
blog.cryptographyengineering.com
|
|
| | | | | This is the third and penultimate post in a series about theoretical weaknesses in Fiat-Shamir as applied to proof systems. The first post is here, the second post is here, and you should probably read them. Over the past two posts I've given a bit of background on four subjects: (1) interactive proof systems (for... | |
| | | | |
neilmadden.blog
|
|
| | | When working with Message Authentication Codes (MACs), you often need to authenticate not just a single string, but multiple fields of data. For example, when creating an authenticated encryption mode by composing a cipher and a MAC (like AES-CBC and HMAC), you need to ensure the MAC covers the IV, associated data, and the ciphertext.... | ||
