Shuffle Arguments Based on Subset-Checking

Behzad Abdolmaleki; Prastudy Fauzi; Toomas Krips; Janno Siim

Paper 2024/1056

Shuffle Arguments Based on Subset-Checking

Behzad Abdolmaleki, University of Sheffield, UK

Prastudy Fauzi

, Nanyang Technological University, Singapore

Toomas Krips

, University of Tartu, Estonia

Janno Siim

, Simula UiB, Norway

Abstract

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 solution (SIS) assumption. Our shuffle argument has prover and verifier complexity linear in the size of the shuffled set, and communication complexity logarithmic both in the shuffled set size and security parameter.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: zero-knowledge shuffle argument electronic voting
Contact author(s): abdolmaleki behzad @ yahoo com
prastudy fauzi @ gmail com
toomas krips @ ut ee
jannosiim @ gmail com
History: 2024-06-30: approved; 2024-06-28: received; See all versions
Short URL: https://ia.cr/2024/1056
License: CC BY

BibTeX

@misc{cryptoeprint:2024/1056,
      author = {Behzad Abdolmaleki and Prastudy Fauzi and Toomas Krips and Janno Siim},
      title = {Shuffle Arguments Based on Subset-Checking},
      howpublished = {Cryptology ePrint Archive, Paper 2024/1056},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/1056}},
      url = {https://eprint.iacr.org/2024/1056}
}