A Restricted Multi-show Credential System and Its Application on E-Voting
A multi-show credential system allows a user to unlinkably and anonymously demonstrate the possession of a credential as many times as the user desires. In some applications, this could be too flexible to be useful. In this paper, we propose a restricted version of such a system. The restricted multi-show credential system only allows the user to demonstrate his possession of a credential once in a given period of time. This time period can also be quantified to a sequence of discrete events. That is, each credential can only be shown once in each event. However, the same credential can still be shown anonymously in another event without being linked. On its applications, we propose a restricted multi-show credential based e-voting system. The e-voting system has the following desirable properties. (1) Simplicity: each user only registers once when he first joins the system and no additional registration/setup phase is needed for the user before casting a vote in each subsequent voting event. (2) Flexibility: the set of eligible voters can be different for different voting events with no additional overhead. (3) Unlinkability: the voters among different voting events cannot be linked. (4) Efficiency: The system maintains the same order of efficiency no matter a voting event is “yes/no” type, “1-out-of-n” type or even “t-out-of-n” type. Furthermore, we show how to extend the e-voting system into an electronic questionnaire system.
Unable to display preview. Download preview PDF.
- 2.Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections. In: Proc. 26th ACM Symp. on Theory of Computing (STOC), pp. 544–553. ACM, New York (1994)Google Scholar
- 3.Brands, S.: An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI (April 1993)Google Scholar
- 4.Brands, S.: Rapid demonstration of linear relations connected by boolean operators. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 318–333. Springer, Heidelberg (1997)Google Scholar
- 6.Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Sommer, G., Daniilidis, K., Pauli, J. (eds.) CAIP 1997. LNCS, vol. 1296, pp. 410–424. Springer, Heidelberg (1997)Google Scholar
- 7.Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical Report TR260, Institute for Theoretical Computer Science, ETH Zurich (March 1997)Google Scholar
- 8.Chan, R., Wong, J., Chan, A.: Anonymous electronic voting system with non-transferable voting passes. In: SEC 2000. IFIP Conference Proceedings, vol. 175, pp. 321–330. Kluwer, Dordrecht (2000)Google Scholar
- 11.Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)Google Scholar
- 12.Fiat, A., Shamir, A.: How to prove yourself: Practical solution to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)Google Scholar
- 13.Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale election. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–260. Springer, Heidelberg (1993)Google Scholar
- 14.Fujisaki, E., Okamoto, T.: Witness hiding protocols to confirm modular polynomial relations. In: Proc. the 1997 Symposium on Cryptography and Information Security. The Institute of Electronics, Information and Communication Engineers, pp. SCS197–233D (1997)Google Scholar
- 17.Liu, J., Wei, V., Wong, D.: Linkable spontaneous anonymous group signature for ad hoc groups. Cryptology ePrint Archive, Report 2004/027 (2004), http://eprint.iacr.org/
- 19.Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 248–259. Springer, Heidelberg (1994)Google Scholar
- 21.Shoup, V., Rubin, A.: Session key distribution using smart card. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 321–331. Springer, Heidelberg (1996)Google Scholar