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 RSA-based Vector Commitments #119

nicola opened this issue May 24, 2019 · 0 comments


None yet
1 participant
Copy link

commented May 24, 2019

A Vector Commitment (VC) is a position binding commitment and can be opened at any position to a unique value with a short proof (sublinear in the length of the vector). The Merkle tree is a VC with logarithmic size openings.

Recent work on RSA-based VC (Boneh et al. 2019) allows for constant size openings as well as aggregatable proofs, which makes it appealing for several decentralized applications (stateless blockchains, proof of storage).

The Filecoin Research team is working on an improving the current protocols to make them more efficient and to construct succinct Proofs of Storage based on RSA-based VC.

The output of this work is to implement a VC library with our latest research and applications to Proof-of-Storage.

Current implementations:

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.