Search

A CCA-secure verifiable Mix-Net protocol with provable security was proposed.The protocol was based on Wikström’s Mix-Net and improves its security by introducing an improved key generation algorithm and a new method for constructing proof of secret shuffling.Without revealing the correspondence between inputs and outputs,proposed protocol enables everyone to verify the correctness of output plaintexts through checking evidences broadcasted by each server.Thus,it satisfies public verifiability.Any sender can trace and examine the processing procedure of its ciphertext.Thus,proposed protocol satisfies sender verifiability.It is prored to be CCA-secure under the assumption of random oracle.Compared with previous mix-net schemes which are CCA-secure,proposed protocol does not require any trusted center,and incurs fewer interactions between servers which also resulting in a lower computation and communication complexity.Hence,the protocol is an ideal cryptographic tool for constructing secure electronic election protocol.

A CCA-secure verifiable Mix-Net protocol with provable security was proposed.The protocol was based on Wikström’s Mix-Net and improves its security by introducing an improved key generation algorithm and a new method for constructing proof of secret shuffling.Without revealing the correspondence between inputs and outputs,proposed protocol enables everyone to verify the correctness of output plaintexts through checking evidences broadcasted by each server.Thus,it satisfies public verifiability.Any sender can trace and examine the processing procedure of its ciphertext.Thus,proposed protocol satisfies sender verifiability.It is prored to be CCA-secure under the assumption of random oracle.Compared with previous mix-net schemes which are CCA-secure,proposed protocol does not require any trusted center,and incurs fewer interactions between servers which also resulting in a lower computation and communication complexity.Hence,the protocol is an ideal cryptographic tool for constructing secure electronic election protocol.

An efficient hybrid-encryption-based Mix-net is presented that is much faster than all previous Mix-nets with public verifiability when all mix-servers execute the mixing protocol honestly (the usual case).The improvement by taking an “optimistic” and hash-based approach to verify the correctness of mixing is achieved without requiring complex and costly zero-knowledge proofs.Only two element-wise testing processes with low-cost computations of hash functions are involved to make certain messages are not manipulated by a cheating server.An efficient integration of public-key and symmetric-key operations also speeds up the mixing.As a result,the computational task of each mix-server is almost independent of the number of mix-servers except for some negligible tasks.Anyone can verify the correctness of a result rapidly by computing a few exponentiations.The scheme is robust,too.Those characteristics make it very suitable for large scale electronic voting.

An efficient hybrid-encryption-based Mix-net is presented that is much faster than all previous Mix-nets with public verifiability when all mix-servers execute the mixing protocol honestly (the usual case).The improvement by taking an “optimistic” and hash-based approach to verify the correctness of mixing is achieved without requiring complex and costly zero-knowledge proofs.Only two element-wise testing processes with low-cost computations of hash functions are involved to make certain messages are not manipulated by a cheating server.An efficient integration of public-key and symmetric-key operations also speeds up the mixing.As a result,the computational task of each mix-server is almost independent of the number of mix-servers except for some negligible tasks.Anyone can verify the correctness of a result rapidly by computing a few exponentiations.The scheme is robust,too.Those characteristics make it very suitable for large scale electronic voting.