Explore >> Select a destination
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
blog.trailofbits.com
|
|
| | | | | ||
| | | | |
rot256.dev
|
|
| | | | | Introduction In this post we will take a look at the Fast Reed-Solomon IOP (FRI) proximity test, which enables an untrusted prover to convince a verifier that a committed vector is close to a Reed-Solomon codeword with communication only poly-logarithmic in the dimension of the code. This is readily used to construct practically efficient zkSNARKs from just cryptographic hash functions (rather random oracles), without the need for a trusted setup. | |
| | | | |
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... | |
| | | | |
www.clickssl.net
|
|
| | | Digital Signature is a process that guarantees that the documents are not modified since it is signed. Learn more about Digital signatures and their types. | ||
