中文摘要：

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

英文摘要：

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 verifiable shuffle） scheme was dependent on the number of mix servers and the number of voters, which could be very inefficient 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.