An Asiacrypt paper on Zero-Knowledge Shuffles
Following the last post, Panoramix members from University of Tartu also got a paper accepted to Asiacrypt 2016. The paper is called “A Shuffle Argument Secure in the Generic Model” (and authored by Prastudy Fauzi and Helger Lipmaa and Michał Zając, all from Tartu; eprint available at http://eprint.iacr.org/2016/866). A verifiable mix-net involves not only the shuffling