Shu ffl e for Paillier ’ s Encryption Scheme
Shu ffl e for Paillier ’ s Encryption Scheme
复制标题
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Takao Onodera;Keisuke Tanaka
中科院分区：
文献类型：
--
作者：
Takao Onodera;Keisuke Tanaka
本文提出了一个shuffle的证明方案，它是Groth和Furukawa协议等知识的诚实验证者零知识证明。与Furukawa-Sako，Groth和Furukawa提出的方案不同，我们的方案可以用作Paillier加密方案加密的元素的洗牌，该方案在消息部分具有加性同态性质。在以前的方案中使用的ElGamal加密方案不具有此属性。关键词：Paillier加密方案，零知识证明，混洗
In this paper, we propose a proof scheme of shuffle, which is an honest verifier zero-knowledge proof of knowledge such as the protocols by Groth and Furukawa. Unlike the previous schemes proposed by Furukawa-Sako, Groth, and Furukawa, our scheme can be used as the shuffle of the elements encrypted by Paillier’s encryption scheme, which has an additive homomorphic property in the message part. The ElGamal encryption scheme used in the previous schemes does not have this property. key words: Paillier’s encryption scheme, zero-knowledge proof, shuffle