본문 바로가기
KERD
논문KCI 등재

전자투표 시스템을 위한 효율적인 믹스넷

An Efficient Mixnet for Electronic Voting Systems

0

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류컴퓨터학

초록

2010년, Sebe 등은 원격 투표에 사용할 수 있는, 가벼우면서도 효율적인 믹스넷 방식을 제안하였다. 이 방식은 암호학적 해쉬연산 만을 이용하기 때문에 기존 방식처럼 복잡한 영지식증명(zero-knowledge proofs)이 필요없이 간단하면서도 믹스넷의 동작을 효율적으로 증명할 수 있는 장점이 있다. 본 논문에서는 Sebe 등이 이용한 가정 사항을 그대로 유지하면서 보다 효율적인 믹스넷을 제안한다.

Abstract

In 2010, Sebe et al. proposed an efficient and lightweight mixnet scheme for remote voting systems. The scheme based on a cryptographic secure hash function, does not require complex and costly zero-knowledge proofs of their correct mixing operations, thus they claimed that their scheme is simple and efficient. In this paper, we propose more efficient and fast mixnet scheme than Sebe et al.'s scheme under the same assumption.

참고문헌 (25)

  1. 전웅렬, "전자투표 실용화 현황과전망", 한국정보보호학회지, 21(2), pp.86~92 (2011)
  2. Secret-ballot receipt andTransparent integrity, "D. Chaum", ~ (2002)
  3. D. Chaum, "Secret-Ballot Receipts : TrueVoter-Verifiable Elections", IEEE Securityand Privacy magazine, 2(1), pp.38~47 (2004)
  4. "Verifiable e-VotingIndisputable Electronic Elections at Polling Places" (2003)[URL]
  5. "Pret aVoter: a System Perspective" (2005)[URL]
  6. Y.Lee, "Towards trustworthy e-votingusing paper receipts", Computer Standardsand Interfaces, 32, pp.305~311 (2010)
  7. D.Chaun, "Scantegrity : End-to-End Voter-VerifiableOptical Scan Voting", IEEE Security &Privacy, pp.40~46 (2008)
  8. D. Chaum, "Untraceable Electronic MailReturn Address and digital Pseudonyms", Comm. of the ACM, 24(2), pp.84~88 (1981)
  9. A.C.Neff, "A Verifiable Secret Shuffleand Its Application to E-Voting", Proc.of the 8th ACM Conference on Computersand Communications Security(CCS-8), pp.116~125 (2001)
  10. P.Golle, "Universal Re-encryption forMixnets, CT-RSA 2004", LNCS, 2964, pp.163~178 (2004)
  11. K.Sako, "Receipt-FreeMix-Type Voting Scheme - A PracticalSolution to the Implementation of aVoting Booth, Proc. of Advances inCryptology(Eurocrypt'95)", LNCS, 921, pp.393~403 (1995)
  12. Millimix :Mixing in small batches, "M.Jakobsson", 33~99 (1999)
  13. M.Jakobsson, "Making Mix Nets Robust for ElectronicVoting by Randomized Partial Checking", Proc. of the 11th USENIX SecuritySymposium, pp.339~353 (2002)
  14. M. Jakobsson, "A Practical Mix, Proc. ofAdvances in Cryptology(Eurocrypt'98)", LNCS, 1403, pp.448~461 (1998)
  15. M. Abe, "Mix-networks on permutationnetworks, Proc. of Asiacrypt'99", LNCS, 1716, pp.258~273 (1999)
  16. B.Pfitzmann, "How toBreak the Direct RSA-Implementation of Mixes, Proc. of Advances in Cryptology(Eurocrypt'89)", LNCS, 434, pp.373~381 (1989)
  17. A DependabilityAnalysis of the Chaum DigitalVoting Scheme, "J.Bryans", School of Computing Science,Newcastle University, ~, pp.Technical ReportCS-TR:809 (2003)
  18. F.Sebe, "Simple and efficient hash-basedverifiable mixing for remote electronicvoting", Computer Communications, 33, pp.667~675 (2010)
  19. R. Anderson, "Robustnessprinciples for public key protocols, Advances in Cryptology, CRYPTO'95", LNCS, 963, pp.236~247 (1995)
  20. A. Juels, "Squealing euros : privacy protection in RFID-enabledbanknotes, Proc. of the Financial Cryptography", LNCS, 2742, pp.103~121 (2003)
  21. J. Arkko, "Enhanced route optimization for mobileIPv6", RFC 4866, ~ (2007)
  22. W. Stallings, "Cryptography and networksecurity: principles and practices" (2005), Prentice Hall
  23. 홍길동, "정보보호에 관한 연구", 박사, pp.2009
  24. S.A. Weis, "New foundations for efficientauthentication, commutative cryptography,and private disjointness testing", 박사, pp.2006
  25. Quantifyinginformation leakage in tree-based hashprotocols, "K. Nohl", Computer ScienceDepartment, University of Virginia, ~, pp.CS-2006-20 (2006)

관련 논문AI추천

이 간행물의 다른 논문 (18건)