Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-09-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015186/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539698637406208 |
|---|---|
| author | Xiao-gang CHENG Jian WANG Yong-hong CHEN |
| author_facet | Xiao-gang CHENG Jian WANG Yong-hong CHEN |
| author_sort | Xiao-gang CHENG |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-f2578b206d8d44aba59ccde39b979ea0 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2015-09-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-f2578b206d8d44aba59ccde39b979ea02025-01-14T06:53:38ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2015-09-013618819259695786Highly efficient compact verifiable shuffle scheme based on QA-NIZK proofXiao-gang CHENGJian WANGYong-hong CHENTo 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015186/compact verifiable shufflemalleabilitye-votingQA-NIZK |
| spellingShingle | Xiao-gang CHENG Jian WANG Yong-hong CHEN Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof Tongxin xuebao compact verifiable shuffle malleability e-voting QA-NIZK |
| title | Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof |
| title_full | Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof |
| title_fullStr | Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof |
| title_full_unstemmed | Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof |
| title_short | Highly efficient compact verifiable shuffle scheme based on QA-NIZK proof |
| title_sort | highly efficient compact verifiable shuffle scheme based on qa nizk proof |
| topic | compact verifiable shuffle malleability e-voting QA-NIZK |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015186/ |
| work_keys_str_mv | AT xiaogangcheng highlyefficientcompactverifiableshuffleschemebasedonqanizkproof AT jianwang highlyefficientcompactverifiableshuffleschemebasedonqanizkproof AT yonghongchen highlyefficientcompactverifiableshuffleschemebasedonqanizkproof |