Prover sends some perm of some G (set b)
V sends over b that fits
Repeat over time, but lots of repetition
How do we squish
P sends over a bunch of permutations
V sends over a bunch of bits
P sends over a bunch of permutations back
Is this an interactive proof, yes because it’s highly unlinkely to be hoodwinked
Is this zero knowledge? No, a simulator cannot answer properly (since must answer correctly for all k)
There’s a committer and receiver.
Committer puts some secret s in a safe. Then sends safe to receiver. Receiver is unable to open safe.
This is the commit phase
Commitment is binding: after a commit, C cannot open two different secrets.
Hiding property: After the commit phase, R cannot predict S.