Security and Privacy in E-voting and RFID System Based on Universal
Yong-Sork Her, 容碩 許, Junichiro Saito, 純一郎 斎藤, Kenji Imamoto, 健二 今本, Kouichi Sakurai, 幸一 櫻井, ヨウソク キョ · Kyushu University Institutional Repository (QIR) (Kyushu University) · 2005
Golle et al. proposed a universal re-encryption scheme for mix-net in RSA2004. In case of re-encryption, this universal re-encryption does not need a public key, but just uses a random encryption factor. Therefore, the decryption is very simple than that of other re-encryption schemes. In this paper, we apply this universal re-encryption to e-voting system and RFID system which have recently received a lot of attention for privacy and security with the advantage of the universal reencryption. Furthermore, we analyze security and privacy of our e-voting system and RFID system. In case of e-voting based on the universal re-encryption, it can take the effective computational complexity because the decryption for the counting of voting contents is possible at once. But, it needs the requirement that the tallier is a trusted party. In case of RFID system, a consumer ’s privacy can be infringed by a strong tracing ability. Although ID of a RFID tag can be encrypted, it is possible to pursue an object by tracing specific information. We discuss security and privacy of e-voting system and RFID system using the universal re-encryption.