AuthorsA. Aggelakis, P. Fauzi, G. Korfiatis, P. Louridas, F. Mergoupis-Anagnou, J. Siim and M. Zając
EditorsS. Jarecki
TitleA Non-Interactive Shuffle Argument With Low Trust Assumptions
AfilliationCryptography
Project(s)Simula UiB
StatusPublished
Publication TypeProceedings, refereed
Year of Publication2020
Conference NameCryptographers’ Track at the RSA Conference (CT-RSA 2020)
Pagination667-692
Date Published02/2020
PublisherSpringer, Cham
KeywordsNon-interactive zero-knowledge, Secure multi-party computation, Shuffle, Subversion security
Abstract

A shuffle argument is a cryptographic primitive for proving correct behaviour of mix-networks without leaking any private information. Several recent constructions of non-interactive shuffle arguments avoid the random oracle model but require the public key to be trusted.

We augment the most efficient argument by Fauzi et al. [Asiacrypt 2017] with a distributed key generation protocol that assures soundness of the argument if at least one party in the protocol is honest and additionally provide a key verification algorithm which guarantees zero-knowledge even if all the parties are malicious. Furthermore, we simplify their construction and improve security by using weaker assumptions while retaining roughly the same level of efficiency. We also provide an implementation to the distributed key generation protocol and the shuffle argument.

URLhttps://eprint.iacr.org/2019/1420
DOI10.1007/978-3-030-40186-3_28
Citation Key27144