Shuffle Arguments Based on Subset-Checking

ePrint Report: Shuffle Arguments Based on Subset-Checking

Behzad Abdolmaleki, Prastudy Fauzi, Toomas Krips, Janno Siim

Zero-knowledge shuffle arguments are a useful tool for constructing mix-nets which enable anonymous communication. We propose a new shuffle argument using a novel technique that probabilistically checks that each weighted set of input elements corresponds to some weighted set of output elements, with weights from the same set as the input element weights. We achieve this using standard discrete log assumptions and the shortest integer …

anonymous argument communication enable eprint report input knowledge novel report shuffle tool using