Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient zero-knowledge argument for correctness of a shuffle (2012)
| Content Provider | CiteSeerX |
|---|---|
| Author | Groth, Jens Ishai, Yuval |
| Description | A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, which in turn are used in protocols for anonymization and voting. Since the plaintexts are encrypted it is not directly verifiable whether a shuffle is correct, and it is often necessary to prove the correctness of a shuffle using a zero-knowledge proof or argument. In previous zero-knowledge shuffle arguments from the literature the communication complexity grows linearly with the number of ciphertexts in the shuffle. We suggest the first practical shuffle ar-gument with sub-linear communication complexity. Our result stems from combining previous work on shuffle arguments with ideas taken from probabilistically checkable proofs. |
| File Format | |
| Language | English |
| Publisher Date | 2012-01-01 |
| Access Restriction | Open |
| Subject Keyword | Shuffle Argument Zero-knowledge Proof Permuted Order Previous Work Communication Complexity Sub-linear Communication Complexity Efficient Zero-knowledge Argument Checkable Proof Previous Zero-knowledge Shuffle Argument Homomorphic Encryption Key Component First Practical Shuffle New Set |
| Content Type | Text |
| Resource Type | Article |
