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
Creating commits for values #123
Comments
This might be a naive question, but couldn't we say re-use the VRF functionality for this? If the It'll be easier to manage than unique nonces in the long run (just a second private key needs to be stored), and won't require additional data-layer I/O for each leaf node. |
After some offline discussion with Jasleen, we will use a keyed hash (modeled as a random oracle) as a commitment here. This means we need the server to hold a commitment_key server. The server needs to generate a proof for each label+value, and send this proof as a component of the lookup and update proofs. The client can then verify the proofs by supplying the raw value and checking that the commitment matches. Construction: proof = H(commitment_key, label, version, value) |
QQ: How do the clients verify the proof without the commitment key? In other words, how they verify that the proof is generated over the correct label, version and value? |
Originally, the commitment was |
That clarifies it, thank you @Jasleen1! |
At the moment the values being committed in the tree for prototyping are all dummies. We would like to replace the
value_to_bytes
function indirectory.rs
to return actual commitments instead. This involves 3 main steps:value_to_bytes
to return a byte array derived from a digest instead.The text was updated successfully, but these errors were encountered: