Download presentation

Presentation is loading. Please wait.

Published bySade Gillott Modified over 4 years ago

1
Efficient Zero-Knowledge Argument for Correctness of a Shuffle Stephanie Bayer University College London Jens Groth University College London

2
Motivation – e-voting Voting:- Voter casts secret vote - Authorities reveal votes in random permuted order E-voting:- voter casts secret votes on a computer -The votes are sent to a server who sends all votes to the central authorities -Authorities reveal votes in random permuted order

3
Background - ElGamal encryption

4
Shuffle...

5
Mix-net: … Threshold decryption

6
Problem: Corrupt mix-server … Threshold decryption

7
Solution: Zero-knowledge argument … Threshold decryption ZK argument No message changed (soundness) ZK argument Permutation still secret (zero-knowledge)

8
Zero-Knowledge Argument Requested Properties: –Soundness: The Verifier reject with overwhelming probability if the Prover tries to cheat –Zero-Knowledge: Nothing but the truth is revealed; permutation is secret –Efficient: Small computation and small communication complexity ProverVerifier The Shuffle was done correctly

9
Public coin honest verifier zero-knowledge ProverVerifier Honest verifier zero-knowledge Nothing but truth revealed; permutation secret Can convert to standard zero-knowledge argument

10
Our contribution 9-move public coin honest verifier zero-knowledge argument for correctness of shuffle in common reference string model

11
RoundsProver in expos Verifier in expos Size in kbits Furukawa-Sako 013 FMMOS 025 Furukawa 05 (GL07)3 Terelius-Wikström 105 Neff 01,047 Groth 03,107 Groth-Ishai 087 Bayer-Groth 119

12
Commitments – Length reducing – Computational binding – Perfectly hiding

13
Techniques - Sublinear cost Length reducing commitments Batch verification Sublinear communication cost

14
Shuffle argument

15
3.The prover gives an argument that both commitments are constructed using the same permutation 4.The prover demonstrates that the input ciphertexts are permuted using the same permutation and knowledge of the randomizers used in the re-encryption.

16
Shuffle argument Inexpensive See full paper Expensive Will sketch idea Both polynomials are equal, only the roots are permuted

17
Notation

18
Multi-exponentiation argument idea

19
Multi-exponentiation argument

20
Prover’s computation Computing this matrix costs m 2 n = mN ciphertext expos

21
Reducing the prover’s computation Do not compute entire matrix Instead use techniques for multiplication of polynomials “in the exponent” of ciphertexts Fast Fourier Transform – O(N log m) exponentiations O (1) rounds Interaction – O (N) exponentiations O (log m) rounds

22
Implementation Implementation in C++ using the NTL library and the GMP library Different levels of optimization –Multi-exponentiation techniques –Fast Fourier Transform –Extra Interaction and Toom-Cook

23
Comparison Single argumentArgument Size Verificatum5 min37.7 MB 2 min0.7 MB

24
Thank You

Similar presentations

OK

1 Reducing Complexity Assumptions for Statistically-Hiding Commitment Iftach Haitner Omer Horviz Jonathan Katz Chiu-Yuen Koo Ruggero Morselli Ronen Shaltiel.

1 Reducing Complexity Assumptions for Statistically-Hiding Commitment Iftach Haitner Omer Horviz Jonathan Katz Chiu-Yuen Koo Ruggero Morselli Ronen Shaltiel.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google