Proofs of Restricted Shuffles

DOI10.1007/978-3-642-12678-9_7zbMath1284.94117OpenAlexW2171228961MaRDI QIDQ3558306

Björn Terelius, Douglas Wikström

Publication date: 4 May 2010

Published in: Progress in Cryptology – AFRICACRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12678-9_7

zbMATH Keywords

cryptographic protocolsmix-netselection schemesproof of a shuffle

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (7)

More efficient shuffle argument from unique factorization ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ Improving the Performance of Cryptographic Voting Protocols ⋮ Lattice-Based Proof of a Shuffle ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Verifiable Multi-party Computation with Perfectly Private Audit Trail

This page was built for publication: Proofs of Restricted Shuffles