|Authors||A. Aggelakis, P. Fauzi, G. Korfiatis, P. Louridas, F. Mergoupis-Anagnou, J. Siim and M. Zając|
|Title||A Non-Interactive Shuffle Argument With Low Trust Assumptions|
|Publication Type||Proceedings, refereed|
|Year of Publication||2020|
|Conference Name||Cryptographers’ Track at the RSA Conference (CT-RSA 2020)|
|Keywords||Non-interactive zero-knowledge, Secure multi-party computation, Shuffle, Subversion security|
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.