A restricted multi-show credential system and its application on e-voting

Joseph K. Liu, Duncan S. Wong

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationFirst International Conference on Information Security, Practice and Experience, ISPEC 2005
PublisherSpringer
Pages268-279
Number of pages12
Publication statusPublished - 2005
Externally publishedYes
EventFirst International Conference on Information Security, Practice and Experience, ISPEC 2005 - , Singapore
Duration: 11 Apr 200514 Apr 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
ISSN (Print)0302-9743

Conference

ConferenceFirst International Conference on Information Security, Practice and Experience, ISPEC 2005
CountrySingapore
Period11/04/0514/04/05

Cite this

Liu, J. K., & Wong, D. S. (2005). A restricted multi-show credential system and its application on e-voting. In First International Conference on Information Security, Practice and Experience, ISPEC 2005 (pp. 268-279). (Lecture Notes in Computer Science). Springer.
Liu, Joseph K. ; Wong, Duncan S. / A restricted multi-show credential system and its application on e-voting. First International Conference on Information Security, Practice and Experience, ISPEC 2005. Springer, 2005. pp. 268-279 (Lecture Notes in Computer Science).
@inproceedings{5a149299312e46449fba5e0c229ef888,
title = "A restricted multi-show credential system and its application on e-voting",
abstract = "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.",
author = "Liu, {Joseph K.} and Wong, {Duncan S.}",
year = "2005",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "268--279",
booktitle = "First International Conference on Information Security, Practice and Experience, ISPEC 2005",

}

Liu, JK & Wong, DS 2005, A restricted multi-show credential system and its application on e-voting. in First International Conference on Information Security, Practice and Experience, ISPEC 2005. Lecture Notes in Computer Science, Springer, pp. 268-279, First International Conference on Information Security, Practice and Experience, ISPEC 2005, Singapore, 11/04/05.

A restricted multi-show credential system and its application on e-voting. / Liu, Joseph K.; Wong, Duncan S.

First International Conference on Information Security, Practice and Experience, ISPEC 2005. Springer, 2005. p. 268-279 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - A restricted multi-show credential system and its application on e-voting

AU - Liu, Joseph K.

AU - Wong, Duncan S.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24644455351&partnerID=8YFLogxK

M3 - Conference Paper

T3 - Lecture Notes in Computer Science

SP - 268

EP - 279

BT - First International Conference on Information Security, Practice and Experience, ISPEC 2005

PB - Springer

ER -

Liu JK, Wong DS. A restricted multi-show credential system and its application on e-voting. In First International Conference on Information Security, Practice and Experience, ISPEC 2005. Springer. 2005. p. 268-279. (Lecture Notes in Computer Science).