Multiple Blind Signature for e-Voting and e-Cash.

In this paper, we propose a new cryptographic primitive, called multiple blind signature (MBS), which is designed based on the integration of both normal blind signature scheme and dual signature. The major difference between a normal blind signature and an MBS is that using a normal blind signature, only one message, |$m$|⁠ , can be verified, but using an MBS, any subset, |${M}^{\prime }$|⁠ , of multiple messages in a set, |$M$|⁠ , where |${M}^{\prime}{\subseteq} M$|⁠ , can be verified. With this additional property, we will show that MBS is especially suitable for e-voting and e-cash applications. In other words, we classify these processes in two applications into two phases, on-line and off-line phases. One unique property of this design is that most time-consuming computation and interaction can be performed in advance in off-line phase. There is no cost of computation and interaction in the online phase. [ABSTRACT FROM AUTHOR]