암호학적 믹스넷 기법의 동향과 향후 연구 방향 = Trends on Cryptographic Mix-net Schemes and Their Future Research Directions

국문 초록 (Abstract)

암호학적인 전자투표 시스템에서 투표자의 익명성 (Anonymity)을 보장하는 핵심 기법은 믹스넷 (Mix-net)이다. 믹스넷은 암호화된 투표값을 입력으로 받아 역시 암호화된 투표값을 출력하는데 이때 입력값과 출력값의 연결관계를 제거한 후 출력하는 것이 특징이다. 본 논문에서는 이러한 믹스넷의 기능을 암호학적 기법을 이용해 실현하기 위한 그간의 중요한 연구 결과들을 분류하고 특징을 분석한다. 그 결과를 바탕으로 향후 믹스넷의 연구 방향에 대하여 고찰하고자 한다.

목차 (Table of Contents)

• 요약
• Abstract
• 1. 서론
• 2. 배경지식
• 2.1 Homomorphic Public-key Encryption
• 2.2 Zero-Knowledge Proofs
• 2.3 암호학적 전자투표 기법의 분류
• 3. Mix-net 기반 기법 분류
• 3.1 1세대 Mix-net 기법
• 3.2 2세대 Mix-net 기법
• 3.3 3세대 Mix-net 기법
• 4. Aggregation 기반 기법 분류
• 5. 향후 연구 방향 및 논의 사항
• 5.1 내용 요약
• 5.2 향후 연구 내용
• References

참고문헌 (Reference)

1 B. Adida, "how to shufle in public" 2007

2 D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonym" 24 (24): 84-88, 1981

3 M. Abe, "Universally verifiable MIX with verification work independent of the number of MIX servers" 1998

4 R. Canetti, "Universally composable security" 2001

5 R. Dingledine, "Tor: The second-generation onion router" 2004

6 R. Saltman, "The history and politics of voting technology" Palgrave Macmillan 2006

7 D. Gritzalis, "Secure electronic voting" Kluwer Academic Publishers 2002

8 R. Gennaro, "Secure distributed key generation for discrete-log based cryptosystems" 1999

9 K. Sako, "Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth" 1995

10 P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes" 1999

11 O. Baudron, "Practical multi-candidate election system" 2001

12 P. Golle, "Optimistic mixing for exit-polls, Advances in cryptology-Asiacrypt" 2002

13 R. Cramer, "Multi-authority secret-ballot elections with linear work" 1996

14 M. Abe, "Mix-networks on permutation networks, Advances in cryptology-Asiacrypt" 1999

15 M. Jakobsson, "Millimix: mixing in small batches" DIMACS 1999

16 M. Jakobsson, "Making mix nets robust for electronic voting by randomized partial checking" 2002

17 J. Katz, "Introduction to modern cryptography" CRC Press 2008

18 B. Pfitzmann, "How to break the direct RSA-implementation of mixes" 1990

19 Y. Desmedt, "How to break a practical mix and design a new one" 2001

20 C. Gentry, "Fully homomorphic encryption using ideal lattices" 2009

21 O. Goldreich, "Foundations in cryptography I: Basic tools" Cambridge Press 2001

22 M. Jakobsson, "Flash mixing" 1999

23 D. Wikström, "Five practical attacks for optimistic mixing for exit-polls" 2004

24 W. Ogata, "Fault tolerant anonymous channel" 1997

25 D. Boneh, "Evaluating 2-DNF formulas on ciphertexts" 2005

26 U. Parampalli, "Efficiently shuffling in public" 2012

27 S. Bayer, "Efficient zero-knowledge argument for correctness of a shuffle" 2012

28 C. Park, "Efficient anonymous channel and all/nothing election scheme" 1994

29 J. Benaloh, "Distributing the power of government to enhance the power of voters" 1986

30 B. Pfitzmann, "Breaking efficient anonymous channel" 1994

31 J. Furukawa, "An efficient scheme for proving a shuffle, Advances in cryptology-Crypto" 2001

32 D. Wikström, "An adaptively secure mix-net without erasures" 2006

33 D. Boneh, "Almost entirely correctly mixing with applications to voting" 2002

34 B. Adida, "Advances in cryptographic voting systems" Massachusetts Institute of Technology 2006

35 J. Groth, "A verifiable secret shuffle of homomorphic encryptions" 2003

36 J. Groth, "A verifiable secret shuffle of homomorphic encryptions" 23 (23): 546-579, 2010

37 A. Neff, "A verifiable secret shuffle and its application to e-voting" 2001

38 D. Wikström, "A universally composable mix-net" 2004

39 D. Wikström, "A sender verifiable mix-net and a new proof of a shuffle" 2005

40 J. Benaloh, "A robust an verifiable cryptographically secure election scheme" 1985

41 M. Kim, "A public shuffle without private permutations" 2012

42 T. El Gamal, "A public key cryptosystem and a signature scheme based on discrete logarithms" 33 : 469-472, 1985

43 P. Feldman, "A practical scheme for non-interactive verifiable secret sharing" 1987

44 M. Jakobsson, "A practical mix, Advances in crytpology-Eurocrypt" 1998

45 S. Khazaei, "A mix-net from any CCA2 secure cryptosystem, Advances in cryptology-Asiacrypt" 2012

46 I. Damgård, "A generalization, a simplification and some applications of Paillier's probabilistic public-key system" 2001