Suppose that instead of implementing cryptographic sortition with a verifiable random function, the authors had simply used a hash-function such as SHA-256. In other words, wherever a node computes VRFsk(x), we instead compute SHA-256(node-id||x). There is no longer any need for a proof, since each node’s node-id value is public. What would go wrong?
Answers need only be a few sentences.
Turn in your answer on paper at the start of class. Be sure both your SUNet ID and your name are on the paper.
SCPD students may submit via SCPD before the start of class.