http://iet.metastore.ingenta.com
1887

Anonymous voting by two-round public discussion

Anonymous voting by two-round public discussion

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In 2006, Hao and Zieliński proposed a two-round anonymous veto protocol (called AV-net), which provided exceptional efficiency compared to related techniques. In this study, the authors add a self-tallying function to the AV-net, making it a general-purpose voting protocol. The new protocol works in the same setting as the AV-net – it requires no trusted third parties or private channels, and participants execute the protocol by sending two-round public messages. Compared with related voting protocols in past work, this is significantly more efficient in terms of the number of rounds, computational cost and bandwidth usage.

References

    1. 1)
      • Kiayias, A., Yung, M.: `Self-tallying elections and perfect ballot secrecy', Public Key Cryptography'02, 2002, p. 141–158, (LNCS, 2274).
    2. 2)
      • Groth, J.: `Efficient maximal privacy in boardroom voting and anonymous broadcast', Financial Cryptography'04, 2004, p. 90–104, (LNCS, 3110).
    3. 3)
      • R.J. Anderson . (2008) Security engineering : a guide to building dependable distributed systems.
    4. 4)
      • Cramer, R., Gennaro, R., Schoenmakers, B.: `A secure and optimally efficient multi-authority election scheme', EUROCRYPT'97, May 1997, p. 103–118, (LNCS, 1233).
    5. 5)
      • Benaloh, J.C., Yung, M.: `Distributing the power of a government to enhance the privacy of voters', Proc. Fifth Annual ACM Symp. on Principles of Distributed Computing, 1986, p. 52–62.
    6. 6)
      • Cramer, R., Franklin, M., Schoenmakers, B., Yung, M.: `Multi-authority secret-ballot elections with linear work', EUROCRYPT'96, 1996, p. 72–83, (LNCS, 1070).
    7. 7)
      • Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: `On 2-round secure multiparty computation', Crypto'02, 2002, p. 178–193, (LNCS, 2442).
    8. 8)
      • Hao, F., Zieliński, P.: `A 2-round anonymous veto protocol', Proc. 14th Int. Workshop on Security Protocols, 2006, Cambridge, UK.
    9. 9)
      • Goldreich, O., Micali, S., Wigderson, A.: `How to play any mental game or a completeness theorem for protocols with honest majority', Proc. Nineteenth Annual ACM Conf. on Theory of Computing, 1987, p. 218–229.
    10. 10)
      • D.R. Stinson . (1995) Cryptography: theory and practice.
    11. 11)
      • Lenstra, A.K., Lenstra, H.W.: `Algorithms in number theory', Handbook of Theoretical Computer Science, 1991, p. 673–715.
    12. 12)
      • C.-P. Schnorr . Efficient signature generation by smart cards. J. Cryptol. , 3 , 161 - 174
    13. 13)
      • Cramer, R., Damgård, I., Schoenmakers, B.: `Proofs of partial knowledge and simplified design of witness hiding protocols', Proc. 14th Annual Int. Cryptology Conf. on Advances in Cryptology, 1994, p. 174–187, (LNCS, 839).
    14. 14)
      • Fiat, A., Shamir, A.: `How to prove yourself: practical solutions to identification and signature problems', Crypto'86, 1987, p. 186–194, (LNCS, 263).
    15. 15)
      • R.P. Stanley . (1997) Enumerative combinatorics.
    16. 16)
      • Baudron, O., Fouque, P., Pointcheval, D., Poupard, G., Stern, J.: `Practical multi-candidate election system', Proc. 20th ACM Symp. on Principles of Distributed Computing, 2001, p. 274–283.
    17. 17)
      • Boneh, D.: `The decision Diffie–Hellman problem', Proc. Third Int. Symp. on Algorithmic Number Theory, 1998, p. 48–63, (LNCS, 1423).
    18. 18)
      • Juels, A., Catalano, D., Jakobsson, M.: `Coercion-resistant electronic voting', WPES'05, 2005, p. 61–70.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2008.0127
Loading

Related content

content/journals/10.1049/iet-ifs.2008.0127
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address