인터넷선거 정보보호기술 동향 연구

  • 홍종욱 (고려대학교 정보보호대학원) ;
  • 김건욱 (고려대학교 정보보호대학원) ;
  • 이동훈 (고려대학교 정보보호대학원) ;
  • 임종인 (고려대학교 정보보호대학원)
  • 발행 : 2005.10.01

초록

중앙선거관리위원의 2012년부터 인터넷선거를 시행하겠다는 발표 후, 인터넷선거에 대한 관심이 증대하고 있다 인터넷선거가 현재 사용되는 종이선거방식을 대체하기 위해서는 비밀성, 완전성등과 같은 기본적인 요구사항을 만족해야 하며, 선거를 전자적으로 구성하였을 때 발생할 수 있는 문제점 역시 정확하게 파악하고 해결해야 한다. 흔히 인터넷선거는 다양한 정보보호 기술이 사용되므로 정보보호 기술의 종합 예술이라고 불리운다. 본 논문에서는 인터넷선거에 사용되는 여러 정보보호 기법들을 살펴본다.

키워드

참고문헌

  1. Masayuki Abe. Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-servers. In EUROCRYPT'98. LNCS 1403. pages 437-447. 1998
  2. Alessandro Acquisti. Receipt-Free Homomorphic Elections and Write-in Ballots
  3. J. Benaloh and D. Tuinstra. Receiptfree Secret-ballot Elections
  4. Dan Boneh. and Philippe Golle. Almost Entirely Correct Mixing With Applications to Voting. ACM CCS'02. 2002
  5. David Chaum. Untraceable electronic mail. return addresses, and digital pseudonyms. Communications of the ACM, 24(2) : 84-88, 1981 https://doi.org/10.1145/358549.358563
  6. David Chaum. Blind signatures for untraceable payments. In Advances in Cryptology - Crvpto'82. pages 199-203, Plenum Press. 1983
  7. Atshushi Fujioka. Tatsuaki Okamoto, and Kazuo Ohta. A practical secret voting scheme for large scale elections. In Auscrypt'92, pages 244-251. Springer-Verlag. LNCS 718, 1992
  8. Philippe Galle, Markus Jakobsson, Ari Juels, and Paul Syverson, Universal Reencryption for Mixnets
  9. Markus Jakobsson, Ari Juels, and Ronald L. Rivest. Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking. 2002
  10. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated Verifier Proofs and Their Applications, Advances in Cryptography - EUROCRYPT'96, LNCS 1070, pages 143-154, 1996
  11. Aggelos Kiayias. and Moti Yung. The Vector-Ballot E-Voting Approach
  12. Byoungcheon Lee, Colin Boyd, Ed Dawson, Kwangjo Kim, Jeongmo Yang, and Seungjae Yoo. Providing Receipt-Freeness in Mixnet-Based Voting Protocols. ICISC2003, LNCS 2971. pages 245-258, 2004
  13. Byoungcheon Lee and Kwangio Kim. Receipt-free electronic voting scheme with a tamper-resistant randomizer. In ICISC2002, pages 405-422, 2002
  14. M, Ohkubo. F. Miura, M. Abe, A. Fujioka and T, Okamoto An Improvement on a Practical Secret Voting Scheme
  15. Tatsuaki Okamoto. Receipt-free electronic voting schemes for large scale elections. In Security Protocols Workshop, pages 25-35. Springer-Verlag, LNCS 1361. 1997
  16. Pascal Paillier. Public-keycryptosystems based on composite degree residuosity classes. In J. Stern. editor, EUROCRYPT '99. pages 223-238. Springer-Verlag. LNCS 1592, 1999
  17. Kun Peng. Riza Aditya, Colin Boyd, Ed Dawson. and Byoungcheon Lee. Multiplicative Homomorphic E- Voting. INDOCRYPT 2004, LNCS 3348, pages 6172, 2004
  18. K. Sako and J. Kilian, Receipt-free Mix-Type Voting Scheme, In EUROCRYPT '95, pages 393-403. Springer-Verlag, LNCS 921. 1995
  19. Adi Shamir. How to share a secret, Communications of the ACM, 22 : 612-613, 1979 https://doi.org/10.1145/359168.359176
  20. Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers, A Secure and optimally efficient multi-authoruty election scheme EUROCRYPT, 1997
  21. Berry Scheonmakers, A simple publicly verifiable secret sharing scheme and its application to electronic voting, CRYPTO, 148-164, 1999
  22. www.rsasecurity.com
  23. Olivier Baudron, Pierre-Alain Fouque. David Pointcheval. Guillaume Poupard, and Jacques Stern. Practical multicandidate election system. PODC '01 274-283. ACM, 2001