Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees

ePrint Report: Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees

Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa

Lookup arguments allow to prove that the elements of a committed vector come from a (bigger) committed table. They enable novel approaches to reduce the prover complexity of general-purpose zkSNARKs, implementing “non-arithmetic operations” such as range checks, XOR and AND more efficiently. We extend the notion of lookup arguments along two directions and improve their efficiency:


(1) we …

applications complexity decision enable eprint report extensions knowledge novel prove report trees