Explore >> Select a destination
|
You are here 
|
vitalik.eth.limo | ||
| | | | |
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... | |
| | | | |
blog.lambdaclass.com
|
|
| | | | | 1. Introduction 1.1 Motivation Imagine you want to do a complex computation, that you cannot carry out in your computer, or you need to get the results from a computer that you don't trust. How can you be sure it was done correctly without redoing it yourself or understanding | |
| | | | |
blog.lambdaclass.com
|
|
| | | | | Introduction The use of efficient zk-SNARKs (zero-knowledge succinct non-interactive arguments of knowledge) has given rise to many new and vital applications. For example, we can delegate expensive computations to untrusted servers and receive proof showing the integrity of the computations. This proof is short and can be verified much faster | |
| | | | |
francisbach.com
|
|
| | | |||
