Cryptography Reference
In-Depth Information
Pfitzmann [
52
], put forth that reading errors in the code may cause failure
of the system to facilitate the marking assumption. Kiayias and Yung [
70
],
identify marking assumption collapse in the context of traitor tracing schemes
and propose the use of all-or-nothing transforms of [
98
] to deal with it in
this particular context. Safavi-Naini and Wang [
101
] consider the problem in
terms of shortening as well as corrupting the object and present some related
constructions.
In the same context, Boneh and Naor [
21
] deal with this issue in traitor
tracing schemes and extend the marking assumption with the notion of δ-
robustness. This extension of the marking assumption allows the adversary to
adaptively corrupt a δ-fraction of the codeword they produce. This fraction
can account for corrupting elementary objects by padding them with elemen-
tary objects of low utility or otherwise unreadable. This relaxation gives rise
to δ-robust fingerprinting codes. An optimal up to logarithmic factors con-
struction of such codes appears in [
20
].
The combinatorial properties of the subclasses of fingerprinting codes that
were treated in this chapter were discussed in [
111
]. A number of works,
including [
54
,
100
,
111
,
114
,
113
], investigated further these properties and
proposed explicit constructions.
