White-box security levels following Delerablée-Lepoint-Paillier-Rivain framework.
White-box security levels following Delerablée-Lepoint-Paillier-Rivain framework.
Security Levels
Level 4: Strong Incompressibility (Impossible)
- Adversary cannot create any smaller representation
- Proven impossible for key-fixing encryption
Level 3: Weak Incompressibility (Not attained)
- Would require that an adversary cannot significantly compress without losing functionality
- PQ-WB-KEM does not attain it. Reading 768 entries – 1,536 bytes – regenerates all 7,670,016 bytes of the Construction-B baked table set bit-exactly for 5 of 5 seeds, and the regenerated tables decapsulate 1,000 of 1,000 fresh random ciphertexts; Construction A is reproduced at a budget of 0. The cause is structural: the key-to-table map is Z_q-linear and inverts from one entry
Level 2: Unbreakability (Not attained)
- Would require that an adversary cannot extract the key even with full access
- The clear product coordinates formed before masking yield linear equations for the secret, so no key confidentiality holds against the full white-box adversary
Level 1: One-Wayness (Inherited, black-box)
- Inherited from ML-KEM-768 IND-CCA2 security under FIPS 203
- A property of the underlying KEM, not a white-box guarantee
What Is Delivered
The two properties the construction does deliver sit outside this hierarchy, each scoped to a strictly weaker adversary than the white-box one: second-order DCA resistance of share observation, and division-timing freedom in the protected base multiply.