Efficient and Verifiable Shuffling and Shuffle-Decryption(Application)(<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

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

• 社団法人電子情報通信学会の論文
• 2005-01-01

著者

• FURUKAWA Jun

  NEC Corporation

• Furukawa Jun

  Nec Corp.

関連論文

• Efficient Identity-Based Encryption with Tight Security Reduction(Information Theory and Its Applications)
• Searchable Public-key Broadcast Encryption
• New Short Signature Scheme without Random Oracles
• An Efficient Group Signature Scheme from Bilinear Maps(Discrete Mathematics and Its Applications)
• Secure Detection of Watermarks (Applications) (Cryptography and Information Security)
• An Efficient Publicly Verifiable Mix-Net for Long Inputs(Protocols,Cryptography and Information Security)
• Efficient and Verifiable Shuffling and Shuffle-Decryption(Application)(Cryptography and Information Security)
• Anonymous Credential with Attributes Certification after Registration

スポンサーリンク