Shuffle arguments based on subset-checking

Abdolmaleki, B. orcid.org/0009-0008-8335-2787, Fauzi, P. orcid.org/0000-0001-6800-7821, Krips, T. orcid.org/0000-0003-0981-3553 et al. (1 more author) (2024) Shuffle arguments based on subset-checking. In: Galdi, C. and Phan, D.H., (eds.) Security and Cryptography for Networks. 14th International Conference, SCN 2024, 11-13 Sep 2024, Amalfi, Italy. Lecture Notes in Computer Science, 14973 . Springer Nature Switzerland , pp. 345-366. ISBN 9783031710698

Abstract

Zero-knowledge shuffle arguments are a useful tool for constructing mix-nets which enable anonymous communication. We propose a new shuffle argument using a novel technique that probabilistically checks that each weighted set of input elements corresponds to some weighted set of output elements, with weights from the same set as the input element weights. We achieve this using standard discrete log assumptions and the shortest integer solution (SIS) assumption. Our shuffle argument has prover and verifier complexity linear in the size of the shuffled set, and communication complexity logarithmic both in the shuffled set size and security parameter.

Metadata

Item Type:	Proceedings Paper
Authors/Creators:	Abdolmaleki, B. https://orcid.org/0009-0008-8335-2787 Fauzi, P. https://orcid.org/0000-0001-6800-7821 Krips, T. https://orcid.org/0000-0003-0981-3553 Siim, J. https://orcid.org/0000-0001-5824-7215
Editors:	Galdi, C. Phan, D.H.
Copyright, Publisher and Additional Information:	© 2024 The Authors. Except as otherwise noted, this author-accepted version of a paper published in Security and Cryptography for Networks is made available via the University of Sheffield Research Publications and Copyright Policy under the terms of the Creative Commons Attribution 4.0 International License (CC-BY 4.0), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/
Keywords:	cryptography; data security; public key cryptopgraphy; symmetric cryptography; cryptanalysis and other attacks; block and stream ciphers; hash functions and message authentication codes; digital signatures; security and privacy; information-theoretic techniques; mathematical foundations of cryptography; trust frameworks; security requirements
Dates:	Published: 10 September 2024 Published (online): 9 September 2024
Institution:	The University of Sheffield
Academic Units:	The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User:	Symplectic Sheffield
Date Deposited:	14 Nov 2024 12:06
Last Modified:	14 Nov 2024 12:06
Status:	Published
Publisher:	Springer Nature Switzerland
Series Name:	Lecture Notes in Computer Science
Refereed:	Yes
Identification Number:	10.1007/978-3-031-71070-4_16
Related URLs:	Conference
Open Archives Initiative ID (OAI ID):	oai:eprints.whiterose.ac.uk:219573

Download

Accepted Version

Filename: 2024-1056.pdf

Licence: CC-BY 4.0

CLICK TO DOWNLOAD

CORE (COnnecting REpositories)

Sorry the service is unavailable at the moment. Please try again later.

Shuffle arguments based on subset-checking

Abstract

Metadata

Download

Accepted Version

Export

Statistics