3 ms·

I don't understand the Sudoku example. It says it's non-interactive, but the verifier is interacting with a "machine". The machine prevents the verifier from do

I don't understand the Sudoku example. It says it's non-interactive, but the verifier is interacting with a "machine". The machine prevents the verifier from doing whatever they want with the provided data, shuffles cards, does a bunch of things. That's interaction. Non-interactivity to me would be if the verifier just got a blob of data and was able to do whatever they wanted with that.

dan-robertson 5y ago
The face up and face down cards would really be numbers, and the “machine” means applying some algorithm to the numbers to combine and then check them. Bob could do that by himself. The key idea is that these numbers somehow don’t reveal which digit goes where.
- fiatjaf 5y ago
  Why can't Bob just look at all cards as he pleases?
  - chaboud 5y ago
    Typically the “mixing of the cards” is done via a one-way function (e.g., modular arithmetic), making it impractical to fake and impractical to reverse.
jjnoakes 5y ago
Non-interactive in this context, I think, means Alice does something and then Bob verifies it (perhaps with some piece in the middle that both Alice and Bob observe) but there is no back-and-forth, only that single one-directional flow of information.