Non-interactive Universal Arguments

ePrint Report: Non-interactive Universal Arguments

Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon

In 2002, Barak and Goldreich introduced the notion of a universal argument and constructed an interactive universal argument for non-deterministic computations based on polynomially hard collision-resistant hash functions. Since then, and especially in recent years, there have been tremendous developments in the construction of non-interactive succinct arguments for deterministic computations under standard hardness assumptions. However, the constructed succinct arguments can be proven universal only under sub-exponential assumptions. …

argument barak case collision complexity construction encryption eprint report fully homomorphic encryption functions general hard hash hash functions homomorphic encryption non omer prove report standard under