Explore >> Select a destination
|
You are here 
|
rot256.dev | ||
| | | | |
blog.lambdaclass.com
|
|
| | | | | Introduction STARKs (scalable transparent arguments of knowledge) have gained a lot of attention in recent years due to their capacity to help scale Ethereum and other L1s. They provide a way to guarantee the integrity of a computation carried out by an untrusted party via cryptographic proof. This proof can | |
| | | | |
blog.lambdaclass.com
|
|
| | | | | Introduction An interactive proof is a protocol between two parties, a prover $\mathcal{P}$ and a verifier $\mathcal{V}$, where the prover attempts to convince the verifier of the validity of a statement. By leveraging randomness and interaction, the verifier can check the statement more efficiently than by doing everything | |
| | | | |
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... | |
| | | | |
nullprogram.com
|
|
| | | |||
