14 search results - page 2 / 3 » Verifiable Rotation of Homomorphic Encryptions |
FC
2009
Springer
13 years 11 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
ESORICS
2010
Springer
13 years 6 months ago
2010
Springer
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
IEEEARES
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
COCO
2007
Springer
13 years 8 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
EUROCRYPT
2008
Springer
13 years 6 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...