Impact
Lookup tables, whose length is not divisible by 26 = floor(num_routed_wires / 3) always include the 0 -> 0 input-output pair. Thus a malicious prover can always prove that f(0) = 0 for any lookup table f (unless its length happens to be divisible by 26).
The cause of problem is that the LookupTableGate-s are padded with zeros.
The fix is done by padding with an existing table pair, similarly to LookupGate.
A workaround from the user side is to extend the table (by repeating some entries) so that its length becomes divisible by 26.
Fortunately, the seemingly most common use case, namely, hash functions with table-based sbox-es, are not vulnerable:
- both Monolith's and Tip5/Tip4's s-box tables already map 0 to 0;
- more generally, forcing several (0,0) pairs inside such a hash function appears to be a too strong restriction to find an otherwise valid trace.
A malicious prover exploiting this could cheat a circuit which statement is the following:
- output
x + f(x) for some private input x, where f(x) := 100 - x is implemented by a lookup table.
A malicious prover would be able to convince an honest verifier that they know an 0 <= x < 64 such that x + (100 - x) = 0.
Patches
Yes, upgrade to v1.0.1
Workarounds
No
References
bkomuves Finder
Impact
Lookup tables, whose length is not divisible by
26 = floor(num_routed_wires / 3)always include the0 -> 0input-output pair. Thus a malicious prover can always prove thatf(0) = 0for any lookup table f (unless its length happens to be divisible by 26).The cause of problem is that the
LookupTableGate-s are padded with zeros.The fix is done by padding with an existing table pair, similarly to
LookupGate.A workaround from the user side is to extend the table (by repeating some entries) so that its length becomes divisible by 26.
Fortunately, the seemingly most common use case, namely, hash functions with table-based sbox-es, are not vulnerable:
A malicious prover exploiting this could cheat a circuit which statement is the following:
x + f(x)for some private inputx, wheref(x) := 100 - xis implemented by a lookup table.A malicious prover would be able to convince an honest verifier that they know an
0 <= x < 64such thatx + (100 - x) = 0.Patches
Yes, upgrade to v1.0.1
Workarounds
No
References