IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2005 · 62 citations · 0 references
ComputingComputer ScienceAlgorithmsCryptographySecurity ProtocolsCryptographic ComplexityCryptographic Protocol DesignCryptographic ProtocolsKey Exchange ProtocolsSecurity Protocol VerificationZero-knowledge ProofsElgamal EncryptionFormal Verification Of Cryptographic ProtocolsKey Exchange Protocol VerificationKey Exchange VerificationRound ComplexityVerifiable ComputationZero-knowledge Proof ProtocolsZero-knowledge Protocol Verification
In this paper, we propose an efficient protocol for proving the correctness of shuffling and an efficient protocol for simultaneously proving the correctness of both shuffling and decryption. The former protocol is the most efficient in computational and communication complexity among 3-move honest verifier perfect zero-knowledge protocols for proving a shuffling of ElGamal cipher-texts. The latter protocol is the most efficient in computational, communication, and round complexity, as a whole, in proving the correctness of both shuffling and decryption of ElGamal cipher-texts. The proposed protocols will be a building block of an efficient, universally verifiable mix-net, whose application to voting systems is prominent.