An Efficient Pairing-Based Shuffle Argument

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Prastudy Fauzi (Aarhus University), Helger Lipmaa (University of Tartu), Janno Siim (University of Tartu and STACC), Michał Zając (University of Tartu)

Journal publisher: ASIACRYPT 2017

Published year: 2017