אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Are all SNARG constructions in the random oracle model inherently large? The answer to this question is still open, but I will survey recent work that makes significant progress towards a solution. In particular, we will see a new construction that achieves a smaller argument size. This is the first progress on the Micali construction since it was introduced over 25 years ago. Our construction relies on a strong soundness notion for PCPs and a weak binding notion for commitments. We hope that our work paves the way for understanding if a linear argument size is achievable in the ROM. The talk is based on joint work with Alessandro Chiesa.