Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about new constructions of succinct non-interactive functional commitments and arguments for circuits based on the SIS assumption without random oracles in this research talk by Hoeteck Wee from NTT Research. Explore how these constructions achieve non-interactive functional commitment schemes with O(1)-sized transparent CRS, O(1)-sized commitment, and O(d)-sized openings for boolean circuits of depth d. Discover the development of non-interactive succinct arguments (SNARG for P/poly) featuring O(1)-sized transparent CRS and O(d)-sized unambiguous proofs. Examine how both schemes support fast online verification after a circuit-dependent pre-processing phase without imposing bounds on circuit parameters during set-up. Understand the elementary nature of these constructions that do not rely on correlation-intractable hashing, making them simple yet effective solutions for cryptographic proof systems.
