Abstract
In this work we present a new paradigm for trust and work distribution in a hierarchy of servers that aims to achieve scalability of work and trust simultaneously. The paradigm is implemented with a decryption capability which is distributed and forces a workflow along a tree structure, enforcing distribution of the workload as well as fairness and partial disclosure (privacy) properties. We call the method “tree-homomorphic” since it extends traditional homomorphic encryption and we exemplify its usage within a large scale election scheme, showing how it contributes to the properties that such a scheme needs. We note that existing design models over which e-voting schemes have been designed for, do not adapt to scale with respect to a combination of privacy and trust (fairness); thus we present a model emphasizing the scaling of privacy and fairness in parallel to the growth and distribution of the election structure. We present two instantiations of e-voting schemes that are robust, publicly verifiable, and support multiple candidate ballot casting employing tree-homomorphic encryption schemes. We extend the scheme to allow the voters in a smallest administrated election unit to employ a security mechanism that protects their privacy even if all authorities are corrupt.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Practical Multi-Candidate Election system. In: The Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC (2001)
Benaloh, J.: Verifiable Secret-Ballot Elections, PhD Thesis, Yale University (1987)
Benaloh, J., Yung, M.: Distributing the Power of a Government to Enhance the Privacy of Voters. In: The Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC (1986)
Benaloh, J., Tuinstra, D.: Receipt-Free Secret-Ballot Elections. In: STOC 1994 (1994)
Cohen (Benaloh), J.D., Fischer, M.G.: A Robust and Verifiable Cryptographically Secure Election Scheme. In: FOCS 1985 (1985)
Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
Cramer, R., Damgård, I.B., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)
Cramer, R., Franklin, M.K., Qchoenmakers, B., Yung, M.: Multi-Autority Secret-Ballot Elections with Linear Work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 72–83. Springer, Heidelberg (1996)
Damgård, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. In: Public Key Cryptography 2001, pp. 169–136 (2001)
Damgård, I., Jurik, M.: Client/Server Tradeoffs for Online Elections. In: Public Key Cryptography 2002, pp. 125–140 (2002)
Damgård, I., Jurik, M.: A Length-Flexible Threshold Cryptosystem with Applications. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 350–364. Springer, Heidelberg (2003)
DeMillo, R.A., Lynch, N.A., Merritt, M.: Cryptographic Protocols. In: STOC 1982, pp. 383–400 (1982)
De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: FOCS 1994 (1994)
Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
Fouque, P.-A., Poupard, G., Stern, J.: Sharing Decryption in the Context of Voting or Lotteries. In: The Proceedings of Financial Cryptography 2000 (2000)
Frankel, Y., Gemmell, P., Yung, M.: Witness-Based Cryptographic Program Checking and Robust Function Sharing. In: STOC 1996 (1996)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. In: Eurocrypt 1991 (1991)
Groth, J.: Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast. In: Financial Cryptography 2004, pp. 90–104 (2004)
Kiayias, A., Yung, M.: Self-Tallying Elections and Perfect Ballot Secrecy. In: Proceedings of Public Key Cryptography 2002 (2002)
Kiayias, A., Yung, M.: The Vector Ballot e-Voting Approach. In: Financial Cryptography 2004, pp. 72–89 (2004)
Merrit, M.: Cryptographic Protocols, Ph.D. Thesis, Georgia Institute of Technology (1983)
Okamoto, T.: Receipt-Free Electronic Voting Schemes for Large Scale Elections. In: Workshop on Security Protocols (1997)
Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: The Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), vol. 1291, pp. 51–21
Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 223. Springer, Heidelberg (1999)
Pedersen, T.P.: A threshold Cryptosystem without a Trusted Third Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)
Sako, K., Kilian, J.: Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)
Schoenmakers, B.: A Simple Publicly Verifiable Secret Sharing Scheme and its Applications to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 148. Springer, Heidelberg (1999)
Shanks, D.: Class number, a theory of factorization and genera. In: Proc. Symp. Pure Math., vol. 50, pp. 240–415. AMS, Providence (1971)
Tsiounis, Y., Yung, M.: On the Security of ElGamal Based Encryption. In: Public Key Cryptography (1998)
Yung, M.: Tree-Homomorphic Encryption. In: DIMACS Workshop on Electronic Voting – Theory and Practice (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiayias, A., Yung, M. (2010). Tree-Homomorphic Encryption and Scalable Hierarchical Secret-Ballot Elections. In: Sion, R. (eds) Financial Cryptography and Data Security. FC 2010. Lecture Notes in Computer Science, vol 6052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14577-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-14577-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14576-6
Online ISBN: 978-3-642-14577-3
eBook Packages: Computer ScienceComputer Science (R0)