|
|
Quantum election scheme based on anonymous quantum key distribution |
Zhou Rui-Rui (周瑞瑞)a b, Yang Li (杨理)a |
a State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China; b Graduate University of Chinese Academy of Sciences, Beijing 100049, China |
|
|
Abstract An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented, based on which we construct a quantum election scheme without the help of entanglement state. We show that this election scheme ensures the completeness, soundness, privacy, eligibility, unreusability, fairness, and verifiability of a large-scale election in which the administrator and counter are semi-honest. This election scheme can work even if there exist loss and errors in quantum channels. In addition, any irregularity in this scheme is sensible.
|
Received: 07 January 2012
Revised: 22 March 2012
Accepted manuscript online:
|
PACS:
|
03.65.-w
|
(Quantum mechanics)
|
|
03.67.-a
|
(Quantum information)
|
|
Fund: Project supported by the National Natural Science Foundation of China (Grant No. 61173157) and the Strategy Pilot Project of Chinese Academy of Sciences (Grant No. XDA06010702). |
Corresponding Authors:
Yang Li
E-mail: yangli@gucas.ac.cn
|
Cite this article:
Zhou Rui-Rui (周瑞瑞), Yang Li (杨理) Quantum election scheme based on anonymous quantum key distribution 2012 Chin. Phys. B 21 080301
|
[1] |
Marius I and Ionut P 2011 Computer Science Master Research 1 67
|
[2] |
Chaum D 1981 Commun. ACM 24 84
|
[3] |
Chaum D 1988 Advances in Cryptology-Eurocrypt 1988 (Berlin: Springer-Verlag) p. 177
|
[4] |
Chaum D 1988 J. Cryptology 1 65
|
[5] |
Fujioka A, Okamoto T and Ohta K 1993 Lecture Notes in Computer Science 718 244
|
[6] |
Salomaa A 1996 Public-Key Cryptography 2nd edn. (Berlin: Springer-Verlag) pp. 200-202
|
[7] |
Sako K and Killian J 1995 Advances in Cryptology-Crypto (Berlin: Springer-Verlag) p. 411
|
[8] |
Cranor L F and Cytron R K 1996 Washington University Computer Science Technical Report
|
[9] |
Ibrahim S, Kamat M, Salleh M and Aziz S R A 2003 Proceedings of the 4-th National Conference on Telecommunication Technology p. 193
|
[10] |
Jafari S, Karimpour J and Bagheri N 2011 Int. J. Comput. Sci. Eng. 3 2191
|
[11] |
Kumar S and Walia E 2011 Int. J. Comput. Sci. Eng. 3 1825
|
[12] |
Boykin P O and Roychowdhury V 2003 Phys. Rev. A 67 042317
|
[13] |
Chen K and Lo H K 2005 arXiv: 0404133 [quant-ph]
|
[14] |
Deng F G, Li X H, Zhou H Y and Zhang Z J 2005 Phys. Rev. A 72 044302
|
[15] |
Wang T Y and Wen Q Y 2010 Chin. Phys. B 19 060307
|
[16] |
Gisin N, Ribordy G, Tittel W and Zbinden H 2002 Rev. Mod. Phys. 74 145
|
[17] |
Zhou Y Y and Zhou X J 2011 Acta Phys. Sin. 60 100301 (in Chinese)
|
[18] |
Jiao R Z, Zhang C and Ma H Q 2011 Acta Phys. Sin. 60 110303 (in Chinese)
|
[19] |
Christandl M and Wehner S 2005 Advances in Cryptology-Asiacrypt 3788 217
|
[20] |
Vaccaro J A, Spring J and Chefles A 2007 Phys. Rev. A 75 012333
|
[21] |
Dolev S, Pitowsky I and Tamir B 2006 arXiv: 0602087 [quant-ph]
|
[22] |
Hillery M, Ziman M, Buzek V and Bielikov M 2006 Phys. Lett. A 349 75
|
[23] |
Bonanome M, Buzek V, Hillery M and Ziman M 2011 Phys. Rev. A 84 022331
|
[24] |
Horoshko D and Kilin S 2011 Phys. Lett. A 375 1172
|
[25] |
Li Y and Zeng G 2009 Chin. Opt. Lett. 7 152
|
[26] |
Okamoto T, Suzuki K and Tokunaga Y 2008 NTT Thchnical Review 6
|
[27] |
Li Y and Zeng G 2008 Opt. Rev. 15 219
|
[28] |
Bennett C H and Brassard G 1984 Advances in Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, December 10-12, 1984 Bangalore, India, p. 175
|
[29] |
Ekert A K 1991 Phys. Rev. Lett. 67 661
|
[30] |
Bennett C H 1992 Phys. Rev. Lett. 68 3121
|
[31] |
Wiesner S 1983 ACM Sigact News 15 78
|
[32] |
Yang L, Wu L A and Liu S H 2002 Acta Phys. Sin. 51 961 (in Chinese)
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|