Abstract
The paper proposes a method to implement the role of an election committee in electronic voting. Decisions in the committee need not be made unanimously, rather arbitrarily defined quora are supported.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Prosser, A., Kofler, R., Krimmer, R.: Deploying Electronic Democracy for Public Corporations. In: Traunmüller, R. (ed.) EGOV 2003. LNCS, vol. 2739, pp. 234–239. Springer, Heidelberg (2003)
Shamir, A.: How to share a secret. Comm. ACM 22, 612–613 (1979)
Blakley, R.: Safeguarding cryptographic keys. In: FIPS Conference Procedings, vol. 48, pp. 313–317 (1979)
Beutelspacher, A., Rosenbaum, U.: Projektive Geometrie. Vieweg (1992)
Kersten, A.G.: Shared Secret Schemas aus Geometrischer Sicht. Mitteilungen aus dem mathematischen Seminar Giessen 208 (1992)
Alon, N., Galil, Z., Yung, M.: Dynamic re-sharing verifiable secret sharing against a mobile adversary. In: Proceedings European Symposium on Algorithms, pp. 523–537 (1995)
Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public Key Kryptosystems. Comm. ACM 21, 120–126 (1978)
ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms. IEEE Trans. Inf. Theory 31, 469–472 (1985)
Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Trans. Inf. Theory 6, 644–654 (1976)
Langford, S.: Threshold DSS signatures without a trusted party. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 397–409. Springer, Heidelberg (1995)
Desmedt, Y., Frankel, Y.: Shared Generation of authenticators of signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457–469. Springer, Heidelberg (1992)
De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: 26th ACM Symposium on the Theory of Computing, pp. 522–533 (1994)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust Threshold DSS Signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354–371. Springer, Heidelberg (1996)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and Efficient Sharing of RSA Functions (1996) (manuscript)
Feldman, P., Micali, S.: An Optimal Algorithm for Synchronous Byzantine Agreement. In: ACM Symp. on Theory of Computing, pp. 148–161 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prosser, A., Kofler, R., Krimmer, R., Unger, M.K. (2004). Implementation of Quorum-Based Decisions in an Election Committee. In: Traunmüller, R. (eds) Electronic Government. EGOV 2004. Lecture Notes in Computer Science, vol 3183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30078-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-30078-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22916-2
Online ISBN: 978-3-540-30078-6
eBook Packages: Springer Book Archive