12 search results - page 1 / 3 » A verifiable secret shuffle and its application to e-voting |
CCS
2001
ACM
13 years 8 months ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
JOC
2010
12 years 11 months ago
2010
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
EUROCRYPT
1998
Springer
13 years 9 months ago
1998
Springer
CSFW
2012
IEEE
11 years 7 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
PKC
2009
Springer
14 years 5 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...