Permuted puzzles assumption

The assumption that a secretly permuted Reed-Muller code is indistinguishable from random — equivalently, that moderate-degree polynomials are indistinguishable from random functions given permuted versions of their evaluation graphs — introduced as the basis of the first SK-DEPIR candidate.

TODO: syntax and security definition.

Participates in

Builds on Permuted puzzles assumption

• Permuted puzzles ⇒ DEPIR