5 search results - page 1 / 1 » A Verifiable Secret Shuffle of Homomorphic Encryptions |
JOC
2010
14 years 4 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
2008
Springer
14 years 11 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
PKC
2009
Springer
15 years 10 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...
86
Voted
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
81
Voted
TRUST
2010
Springer
15 years 2 months ago
2010
Springer
Secure outsourcing of computation to an untrusted (cloud) service provider is becoming more and more important. Pure cryptographic solutions based on fully homomorphic and verifia...