Sciweavers

14 search results - page 1 / 3
» Verifiable Rotation of Homomorphic Encryptions
Sort
View
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 5 months ago
Verifiable Rotation of Homomorphic Encryptions
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...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
JOC
2010
82views more  JOC 2010»
12 years 11 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
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-...
Jens Groth
ICMCS
2009
IEEE
151views Multimedia» more  ICMCS 2009»
13 years 2 months ago
Anonymous Biometric Access Control based on homomorphic encryption
In this paper, we consider the problem of incorporating privacy protection in a biometric access control system. An Anonymous Biometric Access Control (ABAC) system is proposed to...
Ying Luo, Sen-Ching S. Cheung, Shuiming Ye
CCS
2011
ACM
12 years 4 months ago
Information-flow types for homomorphic encryptions
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
Cédric Fournet, Jérémy Planul...
EUROCRYPT
2000
Springer
13 years 8 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
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 ...
Martin Hirt, Kazue Sako