flâneur

Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitment... - YouTube

youtube.com · 7,048 words · saved by 1 readers

Skip navigation 17:01 / 37:01 • Why can Dory work at all? Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitment... TheIACR 7.41K subscribers Subscribe Like Share Download Save 270 views 1 year ago TCC 2021 Paper by Jonathan Lee presented at TCC 2021 See https://iacr.org/cryptodb/data/paper.....  … Show more License Creative Commons Attribution license (reuse allowed) Comments are turned off. Learn more Chapters These chapters are auto-generated Intro 0:00 Efficient Transparent Arguments 0:16 Generalised Inner Products and Polynomial Commitments 1:41 Motivation 3:55 Schematic comparison 5:41 What is Dory? 10:21 Preliminaries 12:39 Why can Dory work at all? 14:38 Bulletproofs (0) 17:10 Offloading verification 21:28 Combining 23:35 Second trick 25:04 Dory-reduce 27:04 Getting to a full IPA and PC 29:50 Sundry optimizations 31:48 Implementation 33:45 Performance 34:27 Batching (n = 220) 35:55 Sync to video time All From TheIACR Related Listenable

Paper by Jonathan Lee presented at TCC 2021 See https://iacr.org/cryptodb/data/paper.php?pubkey=31533. The conference program is at https://tcc.iacr.org/2021/program.php hi this video is on dory efficient transparent arguments for generalized products and polynomial commitments i'm jonathan lee the vp of r d at natural trance uh but most of this work happened whilst i was a senior researcher at microsoft research so what's an efficient transparent background well an argument some protocol between proof of p and verify v that's an np language l the cool notion here is that the prover has…

saved by

related reading