Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement zero-knowledge proofs #38

Open
nickboucher opened this issue Jun 14, 2019 · 1 comment
Open

Implement zero-knowledge proofs #38

nickboucher opened this issue Jun 14, 2019 · 1 comment

Comments

@nickboucher
Copy link
Member

No description provided.

@swansonk14
Copy link
Member

Based on the Shuffle-Sum paper, I think we need to do two types of zero-knowledge proofs:

  1. Proof of correct decryption
  2. Proof of correct shuffling

Luckily, the Damgard-Jurik cryptosystem has range proofs that can help with the first point: https://www.brics.dk/DS/03/9/BRICS-DS-03-9.pdf (Section 4.3.4).

The shuffling proofs might be more complex. One description is here: http://www0.cs.ucl.ac.uk/staff/J.Groth/MinimalShuffle.pdf. It's not specific to Damgard-Jurik crypto, but it seems to work for general homomorphic encryption schemes.

I'll keep looking into this to see how difficult it would be to implement these proofs.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@nickboucher @swansonk14