An efficient pairing-based shuffle argument
type: Item
instance of: scholarly article
title: An efficient pairing-based shuffle argument
zbMATH Open document ID: 1380.94088
DOI: 10.1007/978-3-319-70697-9_4
author: Prastudy Fauzi
author: Helger Lipmaa
author: Janno Siim
author: Michal Zajac
publication date: 2018-03-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6848054
zbMATH Keywords: common reference string
zbMATH Keywords: generic group model
zbMATH Keywords: mix-net
zbMATH Keywords: shuffle argument
zbMATH Keywords: zero knowledge
MaRDI profile type: Publication
full work available at URL: 978-3-319-70697-9 4
OpenAlex ID: W2768583136
Recommended article: Q4783736
Recommended article: An Efficient Aggregate Shuffle Argument Scheme
Recommended article: More efficient shuffle argument from unique factorization
Recommended article: On the complexity of iterated shuffle
Recommended article: A generalization of the perfect shuffle
Recommended article: New Techniques for Non-interactive Shuffle and Range Arguments
Recommended article: Q5002851
Recommended article: Perfect shuffling by lazy swaps
Recommended article: A proof of the shuffle conjecture
Recommended article: A Non-interactive Shuffle with Pairing Based Verifiability
description: scientific article; zbMATH DE number 6848054