A Non-interactive Shuffle Argument with Low Trust Assumptions

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

doi:10.1007/978-3-030-40186-3

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 proceeding › Conference 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 language	English
Title of host publication	Topics in Cryptology -- CT-RSA 2020
Editors	Stanislaw Jarecki
Place of Publication	Cham
Publisher	Springer
Pages	667-692
Number of pages	26
ISBN (Electronic)	978-3-030-40186-3
ISBN (Print)	978-3-030-40185-6
DOIs	https://doi.org/10.1007/978-3-030-40186-3
Publication status	Published - 14 Feb 2020
Event	The Cryptographer's Track at the RSA Conference 2020 - San Francisco, United States Duration: 24 Feb 2020 → 28 Feb 2020 https://sites.google.com/view/ctrsa2020/home

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer, Cham
Volume	12006
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	The Cryptographer's Track at the RSA Conference 2020
Abbreviated title	CT-RSA 2020
Country/Territory	United States
City	San Francisco
Period	24/02/20 → 28/02/20
Internet address	https://sites.google.com/view/ctrsa2020/home

Access to Document

10.1007/978-3-030-40186-3Licence: All Rights Reserved

https://link.springer.com/book/10.1007/978-3-030-40186-3Licence: All Rights Reserved

Panoramix:Privacy and Accountability in Networks via Optimized Randomized Mix-nets
Kiayias, A. (Principal Investigator)
EU government bodies
1/09/15 → 31/01/19
Project: Research

Cite this

@inproceedings{0b97885dd4e24cb0b6e21078b3c7d084,

title = "A Non-interactive Shuffle Argument with Low Trust Assumptions",

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.",

author = "Antonis Aggelakis and Prastudy Fauzi and Georgios Korfiatis and Panos Louridas and Foteinos Mergoupis-Anagnou and Janno Siim and Micha{\l} Zajac",

year = "2020",

month = feb,

day = "14",

doi = "10.1007/978-3-030-40186-3",

language = "English",

isbn = "978-3-030-40185-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "667--692",

editor = "Stanislaw Jarecki",

booktitle = "Topics in Cryptology -- CT-RSA 2020",

address = "United Kingdom",

note = "The Cryptographer's Track at the RSA Conference 2020, CT-RSA 2020 ; Conference date: 24-02-2020 Through 28-02-2020",

url = "https://sites.google.com/view/ctrsa2020/home",

}

Aggelakis, A, Fauzi, P, Korfiatis, G, Louridas, P, Mergoupis-Anagnou, F, Siim, J & Zajac, M 2020, A Non-interactive Shuffle Argument with Low Trust Assumptions. in S Jarecki (ed.), Topics in Cryptology -- CT-RSA 2020. Lecture Notes in Computer Science, vol. 12006, Springer, Cham, pp. 667-692, The Cryptographer's Track at the RSA Conference 2020, San Francisco, California, United States, 24/02/20. https://doi.org/10.1007/978-3-030-40186-3

TY - GEN

T1 - A Non-interactive Shuffle Argument with Low Trust Assumptions

AU - Aggelakis, Antonis

AU - Fauzi, Prastudy

AU - Korfiatis, Georgios

AU - Louridas, Panos

AU - Mergoupis-Anagnou, Foteinos

AU - Siim, Janno

AU - Zajac, Michał

PY - 2020/2/14

Y1 - 2020/2/14

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-030-40186-3

DO - 10.1007/978-3-030-40186-3

M3 - Conference contribution

SN - 978-3-030-40185-6

T3 - Lecture Notes in Computer Science

SP - 667

EP - 692

BT - Topics in Cryptology -- CT-RSA 2020

A2 - Jarecki, Stanislaw

PB - Springer

CY - Cham

T2 - The Cryptographer's Track at the RSA Conference 2020

Y2 - 24 February 2020 through 28 February 2020

ER -

A Non-interactive Shuffle Argument with Low Trust Assumptions

Abstract

Publication series

Conference

Access to Document

Fingerprint

Projects

Panoramix:Privacy and Accountability in Networks via Optimized Randomized Mix-nets

Cite this