A Non-interactive Shuffle Argument with Low Trust Assumptions

Antonis Aggelakis, Prastudy Fauzi, Georgios Korfiatis, Panos Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, Michał Zajac

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationTopics in Cryptology -- CT-RSA 2020
EditorsStanislaw Jarecki
Place of PublicationCham
PublisherSpringer International Publishing
Pages667-692
Number of pages26
ISBN (Electronic)978-3-030-40186-3
ISBN (Print)978-3-030-40185-6
DOIs
Publication statusPublished - 14 Feb 2020
EventThe Cryptographer's Track at the RSA Conference 2020 - San Francisco, United States
Duration: 24 Feb 202028 Feb 2020
https://sites.google.com/view/ctrsa2020/home

Publication series

NameLecture Notes in Computer Science
PublisherSpringer, Cham
Volume12006
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceThe Cryptographer's Track at the RSA Conference 2020
Abbreviated titleCT-RSA 2020
CountryUnited States
CitySan Francisco
Period24/02/2028/02/20
Internet address

Cite this