EXHIBIT 06

TWO-OF-TWO QR VISUAL SHARING

Neither QR contains the picture alone.

Each QR is independently scannable and carries an ordinary public message. Its padding contains one random-looking binary shadow. Extract both shadows and XOR them: the hidden image appears.

LIVE 2-OF-2 XOR SHARES / ACTUAL QR PADDING

QR SHADOW LAB

Build two meaningful shadows

The browser creates a fresh random first share. The second share is the first XOR the packed secret image.

QR SHADOW A
Not read
QR SHADOW B
Not read
Predict first

Each QR scans to its own ordinary URL. How much of the secret image does one of them reveal on its own?

WAITING FOR BOTH SHARES

IMPLEMENTATION SCOPE

Two valid QR codes, two hidden shadows, one recovered image.

This exhibit implements the paper's 2-of-2 path: a binary image is split into random-grid XOR shadows, each shadow bitstream replaces padding codewords in a separately scannable cover QR, and the extracted shadows are XORed to recover the image.

It does not reproduce the paper's general k-of-n construction or its physical attack campaign. Browser-generated randomness comes from Web Crypto; this remains an educational implementation rather than a reviewed security product.

Implemented from: Tan, Lu, Yan, Liu & Zhou, “XOR-ed visual secret sharing scheme with robust and meaningful shadows based on QR codes,” Multimedia Tools and Applications 79 (2020), 5719–5741. doi:10.1007/s11042-019-08351-0 FULL

Read the research note