New Techniques for Non-interactive Shuffle and Range Arguments

摘要

We construct the most efficient non-interactive Argument of Correctness of a Shuffle and Range Argument under falsifiable assumptions in asymmetric bilinear groups. Our constructions use as a common building block a novel quasi-adaptive argument for proving that n commitments open to messages in a public set S, with proof-size independent of n.