A proof of a shuffle is a zero-knowledge proof that one list of ciphertexts is a permutation and re-encryption of another list of ci- phertexts. We call a shuffle restricted if the permutation is chosen from a public subset of all permutations.
A proof of a shuffle is a zero-knowledge proof that one list of ciphertexts is a permutation and re-encryption of another list of ciphertexts.
A proof of a shuffle is a zero-knowledge proof that one list of ciphertexts is a permutation and re-encryption of another list of ciphertexts.
Feb 11, 2011 · A proof of a shuffle is a zero-knowledge proof that one list of ciphertexts is a permutation and re-encryption of another list of ciphertexts.
Given a matrix commitment a, P wants to prove knowledge of a permutation matrix M and randomness s such that a = C (M,s).
To guarantee that no ballots are added, omitted or altered, zero-knowledge proofs, called proofs of shuffle, are used to provide publicly verifiable transcripts ...
Missing: Restricted | Show results with:Restricted
Proofs of Restricted Shuffles. B. Terelius, and D. Wikström. AFRICACRYPT, volume 6055 of Lecture Notes in Computer Science, page 100-113. Springer, (2010 ) ...
simple shuffle arguments that allowed the restriction of the shuffles to certain classes of permutations. ... Proofs of restricted shuffles. AFRICACRYPT, LNCS vol ...
Aug 9, 2023 · The most prominent proofs of shuffle, in practice, are those due to Terelius and Wikström (TW), and Bayer and Groth (BG). TW is simpler whereas ...
May 10, 2021 · The resulting proof of shuffle is black-box, easily implementable, simple to explain, and comes with an acceptable computational overhead over ...
Missing: Restricted | Show results with:Restricted