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

Transaction malleability needs to be prevented #7

Closed
AntoineRondelet opened this issue Mar 28, 2019 · 1 comment
Closed

Transaction malleability needs to be prevented #7

AntoineRondelet opened this issue Mar 28, 2019 · 1 comment
Assignees
Labels
arithmetic-circuit/R1CS Task related to the R1CS programs bug Something isn't working

Comments

@AntoineRondelet
Copy link
Contributor

AntoineRondelet commented Mar 28, 2019

See Section 4.15.1 of https://github.com/zcash/zips/blob/master/protocol/protocol.pdf
(or Section 4.10 of the same document).

It should also be feasible to extend the statement with a PoK for the statement I know (m, r) s.t for each c_i (the ciphertexts), c_i = E(m, r). This should enable to "attach/bind" the ciphertexts to the rest of the statement, and force the Adversary willing to modify the ciphertexts of a tx, to generate a new proof. However, I guess that representing E as a multiplicative sub-circuit, and evaluating it on each plaintext is way too "constraint-expensive"..

@AntoineRondelet
Copy link
Contributor Author

Closing as the corresponding PR has been merged

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
arithmetic-circuit/R1CS Task related to the R1CS programs bug Something isn't working
Projects
None yet
Development

No branches or pull requests

2 participants