论文标题
斑点：白盒模型中可证明的不可压缩性和可追溯性
The Blob: provable incompressibility and traceability in the whitebox model
论文作者
论文摘要
我们介绍了一种在WhiteBox Attacker模型中使用加密功能分发和存储软件的方案。我们的计划满足了两个相关特性：不可压缩性和可追溯性。主要思想是存储大量随机数据（a blob'），其中一些将在将来随机采样以用作关键材料，其中一些是水印。我们研究了两个变体：有和没有重复使用关键材料。对于这两种变体，我们都会考虑到针对水印的串谋攻击，可以通过斑点进行多少解密。我们的结果表明，在付费电视的背景下，BLOB方案的应用是可行的。
We introduce a scheme for distributing and storing software with cryptographic functionality in the whitebox attacker model. Our scheme satisfies two relevant properties: incompressibility and traceability. The main idea is to store a large amount of random data (a `blob'), some of which will be randomly sampled in the future to serve as key material, and some of which serves as a watermark. We study two variants: with and without re-use of key material. For both variants we analyse how many decryptions can be performed with the blob, taking into account collusion attacks against the watermark. Our results show that application of blob schemes in the context of pay-TV is feasible.
