Application to verifiable secret shuffle and their electronic voting

摘要

Presents (shuffles can verify) sequence module integer (k) by providing encryption protocol mathematical structure, we discuss applications to verifiable multiple institutions election system without exception safe. Is a sequence of other modules of integer (k), the output of the shuffle operation is a power of the same secret of input elements, each corresponding, but the order of the elements in the output is kept secret. It can be taken by (a person to select a sorting of the elements to be applied) "shuffler", to compute the output from the input is of little, but the configuration, be checked by a verifier of any one or more people It is important because it provides (ie, proof that it is a form that has been claimed) the linear size proof of legitimacy related to the output sequence that can be. It is a zero-knowledge of a fair verifier in special cases is shown, the protocol is zero knowledge of calculation in general. One way to guide the final decision, a generalization of the Chaum-Pedersen protocol well known for knowledge of discrete logarithm type also constructed ([3], [2]). In fact, in the case of a (k) = 2, (exactly) generalization is specialized in the Chaum-Pedersen protocol. If there is a relationship to itself this result. To meet the improvement of important efficiency features of the protocol of the current best, and its application to electronic voting is given. Introduce a completely new paradigm examples to achieve (verifiable without exception) election application alternative to electronic voting is also given.