Results 1691 - 1700 of 23856
Yoav Moran is a PhD candidate at the Hebrew University of Jerusalem under the supervision of Prof. Oded Schwartz. His research is focused on fast matrix multiplication algorithms.
In this talk we will explore incremental verifiable computation (IVC), as well as its generalization PCD. We will show how IVC and PCD is defined, how it can lead to low memory and distributed provers and study more applications. We will also look at constructions from SNARKs and modern constructions from accumulation schemes.
Finally we will discuss open problems in the space.
Functional commitment (FC) schemes are a key primitive in the construction of efficient succinct argument systems. At a high level, FC schemes enable committing to a message, and then later proving the correctness of evaluations of functions over the committed message.
Popular examples include polynomial commitments, vector commitments, and linear-function commitments.
In this talk, I will introduce FC schemes, discuss recent progress on "correct" definitions for them, and provide representative constructions.
The Fiat-Shamir heuristic is an extremely simple, general approach for constructing non-interactive argument systems from public-coin interactive protocols. We survey what is known about the provable security of the Fiat-Shamir heuristic, focusing on correlation intractability and the "bad challenge" paradigm.
Many succinct arguments are obtained by combining an information-theoretic probabilistic proof and a cryptographic commitment scheme. In this talk I will explain how several several popular constructions of succinct arguments can be viewed as special cases of one elegant recipe, facilitating a systematic and precise understanding of a notable region of the SNARG-scape.