A Secure and Efficient Multi-authority Proactive Election Scheme

  • Ashish Kumar Singh
  • Priya Chandran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4812)

Abstract

In this paper we present a new secret-ballot multi-authority election scheme that is proactive and guarantees privacy, universal verifiability and robustness. In our scheme, a voter posts a single encrypted message as the ballot, accompanied by a non-interactive proof that it contains a valid vote. Our scheme is an efficient modification of the result by [CGS97]. The process of key recovery for decryption of votes in our scheme requires only O(r) steps, where r is the number of authorities required to decrypt the key, and the number of messages required for initial setup of the scheme is O(n), where n is the total number of authorities. The time complexity of key recovery in [CGS97] is O(r\(\mbox{log}^2\)r) and the complexity of number of messages is O(\(\mbox{n}^2\)). Thus the proposed scheme is more efficient in terms of time complexity and number of messages required to be sent. We also outline a simple and elegant technique to make our scheme proactive. Our implementation results demonstrate the improved time complexity of the proposed scheme.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [SHA79]
    Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)MATHCrossRefMathSciNetGoogle Scholar
  2. [PED91]
    Pedersen, T.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)Google Scholar
  3. [CGS97]
    Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. European Transactions on Telecommunications 8(5), 481–490 (1997)CrossRefGoogle Scholar
  4. [HJKY95]
    Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive Secret Sharing Or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995)Google Scholar
  5. [AB83]
    Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Transactions on Information Theory IT-29(2), 208–211 (1983)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ashish Kumar Singh
    • 1
  • Priya Chandran
    • 1
  1. 1.National Institute of Technology, Calicut, 673601, KeralaIndia

Personalised recommendations