UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Evaluating security of voting schemes in the universal composability framework

Groth, J; (2004) Evaluating security of voting schemes in the universal composability framework. In: Jakobsson, M and Yung, M and Zhou, JY, (eds.) APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS. (pp. 46 - 60). SPRINGER-VERLAG BERLIN

Full text not available from this repository.


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 protocol with respect to all these requirements and it is not clear that the list of known requirements is complete. Perhaps because of this many papers on electronic voting do not offer any security proof at all.As a solution to this, we suggest, evaluating voting schemes in the universal composability framework. We investigate the popular class of voting schemes based on homomorphic threshold encryption. It turns out that schemes in this class realize an ideal voting functionality that takes the votes as input and outputs the result. This ideal functionality corresponds closely to the well-known ballot box model used today in manual voting. Security properties such as privacy, accuracy and robustness now follow as easy corollaries. We note that some security requirements, for instance incoercibility, are not addressed by our solution.Security holds in the random oracle model against a non-adaptive adversary. We show with a concrete example that the schemes are not secure against adaptive adversaries. We proceed to sketch how to make them secure against adaptive adversaries in the erasure model with virtually no loss of efficiency. We also briefly hint at how to achieve security against adaptive adversaries in the erasure-free model.

Type: Proceedings paper
Title: Evaluating security of voting schemes in the universal composability framework
Event: 2nd International Conference on Applied Cryptography and Network Security
Location: Yellow Mt, PEOPLES R CHINA
Dates: 2004-06-08 - 2004-06-11
ISBN: 3-540-22217-0
Keywords: voting, homomorphic threshold encryption, universal composability, COMPUTATION, GENERATION
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/149914
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item