Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof

Xiao-gang CHENG; Jian WANG; Yong-hong CHEN

doi:10.11959/j.issn.1000-436x.2015186

您当前的位置：

首页 >

文章列表页 >

Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof

academic paper | 更新时间：2024-06-05

- Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof
- Journal on Communications Vol. 36, Issue 9, Pages: 188-192(2015)
- 作者机构：
  
  1. 南京航空航天大学计算机科学与技术学院，江苏南京 210016
  2. 华侨大学计算机科学与技术学院，福建厦门 361021
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61370007);The Natural Science Foundation of Fujian Prov-ince(2013J01241)
- DOI：10.11959/j.issn.1000-436x.2015186
  CLC： TP309
- Online First：2015-09，
  
  Published：25 September 2015
- 稿件说明：
移动端阅览
Xiao-gang CHENG, Jian WANG, Yong-hong CHEN. Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof[J]. Journal on Communications, 2015, 36(9): 188-192.
DOI：

Xiao-gang CHENG, Jian WANG, Yong-hong CHEN. Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof[J]. Journal on Communications, 2015, 36(9): 188-192. DOI： 10.11959/j.issn.1000-436x.2015186.

摘要

电子投票中为保护投票者的隐私，要由一系列混合服务器对选票进行洗牌操作，为保证洗牌操作的诚实性，需要可验证洗牌方案。现有简短可验证洗牌方案的证明大小要依赖于混合服务器的数量和投票者的数量，效率较低。基于近来的一个高效的 QA-NIZK 证明系统构建了一个高效的简短可验证洗牌方案，不管有多少混合器和投票者其证明大小都是O(1)，即常量大小。具有其独立的意义是在构建中指出原QA-NIZK证明系统是可变的。

Abstract

To protect the privacy of voters in e-voting

votes should be shuffled by a series of mix servers.To guarantee the honesty of mix servers

verifiable shuffle scheme was needed.However the proof size of existed CVS (compact veri-fiable shuffle) scheme was dependent on the number of mix servers and the number of voters

which could be very ineffi-cient when there were lots of mix servers and voters.A new CVS scheme was presented with the proof size of only O(1)

i.e.constant no matter how many mix servers and voters were involved.The construction is based on an efficient proof system QA-NIZK (quasi-adaptive non-interactive zero knowledge) presented recently.It also points out that the QA-NIZK proof system is malleable

which is of independent interest.

关键词

Keywords

references

CHAUM D . Untraceable electronic mail,return addresses,and digital pseudonyms [J ] . Communications of ACM , 2008 , 32 ( 5 ): 98 - 101 .

SAKO K , KILIAN J . Receipt-free mix-type voting scheme [A ] . EUROCRYPT 1995 [C ] . Springer , 1995 . 393 - 403 .

BAYER S , GROTH J . Efficient zero-knowledge argument for cor-rectness of a shuffle [A ] . EUROCRYPT 2012 [C ] . Springer , 2012 . 281 - 300 .

GROTH J , ISHAI Y . Sub-linear zero-knowledge argument for correctness of a shuffle [A ] . EUROCRYPT 2008 [C ] . Springer , 2008 . 379 - 396 .

GROTH J . A verifiable secret shuffle of homomorphic encryptions [J ] . Journal of Cryptology , 2010 , 23 ( 4 ): 546 - 579 .

TERELIUS B , WIKSTROM D . Proofs of restricted shuffles [A ] . AF-RICACRYPT 2010 [C ] . Springer , 2010 . 100 - 113 .

PENG K . A shuffle to achieve high efficiency through pre-computa-tion and batch verification [J ] . International Journal of Information Se-curity , 2013 , 12 ( 4 ): 337 - 345 .

GROTH J , LU S . A non-interactive shuffle with pairing based verifi-ability [A ] . ASIACRYPT 2007 [C ] . Springer , 2007 . 51 - 67 .

LIPMAA H , ZHANG B . A more efficient computationally sound non-interactive zero-knowledge shuffle argument [A ] . SCN 2012 [C ] . Springer , 2012 . 477 - 502 .

CHASE M , KOHLWEISS M , LYSYANSKAYA A , et al . Malleable proof systems and applications [A ] . EUROCRYPT 2012 [C ] . Springer , 2012 . 281 - 300 .

CHASE M , KOHLWEISS M , LYSYANSKAYA A , et al . Verifiable elections that scale for free [A ] . PKC 2013 [C ] . Springer , 2013 . 479 - 496 .

CHENG X , WANG J , CHEN Y . Improvement of a compact verifiable shuffle scheme [J ] . ICIC Express Letters,Part B:Applications , 2014 , 5 ( 4 ): 1115 - 1119 .

CHASE M , KOHLWEISS M , LYSYANSKAYA A , et al . Succinct malleable NIZKs and an application to compact shuffles [A ] . TCC 2013 [C ] . Springer , 2013 . 100 - 119 .

JUTLA C , ROY A . Shorter quasi-adaptive NIZK proofs for linear subspaces [A ] . ASIACRYPT 2013 Part I [C ] . Springer , 2013 . 1 - 20 .

GROTH J , SAHAI A . Efficient non-interactive proof systems for bilinear groups [A ] . EUROCRYPT 2008 [C ] . Springer , 2008 . 415 - 432 .

Views

1121

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An Anonymous and Accountable Aggregate Ring Signature Algorithm for Electronic Voting

Related Author

ZENG Jielun

CHEN Jing

HE Kun

JIA Meng

LV Lanxi

DU Ruiying

Related Institution

Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University

AI问答

⁰