Assignment 4, our last assignment, has been posted to T-Square and is due on Wednesday, December 2 at 8 PM. There will be no final exam.
Arefin Huq covered zero-knowledge for Sudoku from the paper Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles by Ronen Gradwohl, Moni Naor, Benny Pinkas and Guy N. Rothblum.
He also discussed bit commitment and presented the zero-knowledge proof for graph isomorphism, comparing and contrasting with the Arthur-Merlin protocol for graph non-isomorphism.
