著者

FURUKAWA Jun

出版者

一般社団法人電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.88, no.1, pp.172-188, 2005-01-01

参考文献数

25

被引用文献数

7 43

---

In this paper, we propose an efficient protocol for proving the correctness of shuffling and an efficient protocol for simultaneously proving the correctness of both shuffling and decryption. The former protocol is the most efficient in computational and communication complexity among 3-move honest verifier perfect zero-knowledge protocols for proving a shuffling of ElGamal cipher-texts. The latter protocol is the most efficient in computational, communication, and round complexity, as a whole, in proving the correctness of both shuffling and decryption of ElGamalcipher-texts. The proposed protocols will be a building block of an efficient, universally verifiable mix-net, whose application to voting systems is prominent.