ABSTRACT
Cryptographic voting protocols have recently seen much interest
from practitioners due to their (planned) use in countries such as
Estonia, Switzerland, France, and Australia. Practical protocols usually rely on tested designs such as the mixing-and-decryption paradigm. There, multiple servers verifiably shuffle encrypted ballots,
which are then decrypted in a distributed manner. While several
efficient protocols implementing this paradigm exist from discrete
log-type assumptions, the situation is less clear for post-quantum
alternatives such as lattices. This is because the design ideas of the
discrete log-based voting protocols do not carry over easily to the
lattice setting, due to specific problems such as noise growth and
approximate relations.
This work proposes a new verifiable secret shuffle for BGV ciphertexts and a compatible verifiable distributed decryption protocol. The shuffle is based on an extension of a shuffle of commitments
to known values which is combined with an amortized proof of
correct re-randomization. The verifiable distributed decryption protocol uses noise drowning, proving服务器托管网 the correctness of decryption
steps in zero-knowledge. Both primitives are then used to instantiate the mixing-and-decryption electronic voting paradigm from
lattice-based assumptions.
We give concrete parameters for our system, estimate the size of
each compon服务器托管网ent and provide implementations of all important subprotocols. Our experiments show that the shuffle and decryption
protocol is suitable for use in real-world e-voting schemes.
服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.fwqtg.net
相关推荐: Flutter三棵树系列之详解各种Key | 京东云技术团队
简介 key是widget、element和semanticsNode的唯一标识，同一个parent下的所有element的key不能重复，但是在特定条件下可以在不同parent下使用相同的key，比如page1和page2都可以使用ValueKey(1) 。…
