Sciweavers

28 search results - page 2 / 6
» Efficient Receipt-Free Voting Based on Homomorphic Encryptio...
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 8 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
EUROCRYPT
2006
Springer
13 years 8 months ago
Efficient Binary Conversion for Paillier Encrypted Values
We consider the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer,
Berry Schoenmakers, Pim Tuyls
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
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
13 years 10 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
FC
2004
Springer
112views Cryptology» more  FC 2004»
13 years 10 months ago
The Vector-Ballot e-Voting Approach
Looking at current cryptographic-based e-voting protocols, one can distinguish three basic design paradigms (or approaches): (a) Mix-Networks based, (b) Homomorphic Encryption base...
Aggelos Kiayias, Moti Yung