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.

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

Implement Presigning/Signing with O(N) identification cost #36

Closed
10 tasks
fjarri opened this issue Sep 15, 2023 · 1 comment
Closed
10 tasks

Implement Presigning/Signing with O(N) identification cost #36

fjarri opened this issue Sep 15, 2023 · 1 comment
Labels
enhancement New feature or request
Milestone

Comments

@fjarri
Copy link
Member

fjarri commented Sep 15, 2023

(Figure and section numbers correspond to the reference paper https://eprint.iacr.org/2021/060)

  • Figure 9: ECDSA Pre-Signing (Rounds 1 to 4) (includes Π^{enc-elg}, Π^{aff-g}, Π^{aff-p}, Π^{log*})
  • Figure 10: ECDSA Pre-Signing (Round 5, 6 & Output) (includes Π^{log*}, Π^{elog})
  • Figure 13: ECDSA Signing

Errors:

  • Figure 11: Nonce-Reveal Fail (includes П^{Nth})
  • Figure 12: Pseudo-Key Reveal Fail (includes П^{Nth}, Π^{log})

Sigma-protocols:

  • Π^{Nth} (Section 2.2.2) - no figure but probably the same as Fig. 23?
  • Figure 23: Dlog Equality – Π^{log}
  • Figure 24: Dlog with El-Gamal Commitment – Π^{elog}
  • Figure 26: Paillier Affine Operation with Paillier Commitment ZK-Proof – Π^{aff-p}
  • Figure 27: Range Proof w/ EL-Gamal Commitment – Π^{enc-elg}
@fjarri
Copy link
Member Author

fjarri commented Nov 19, 2024

The new version of the CGGMP paper removes the 6-round version of the Presigning, since the 3-round one now has O(N) complexity too. This issue is superseded by #157

@fjarri fjarri closed this as completed Nov 19, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant