Skip to main content
2 votes
Accepted

Is it possible to convert a selective secure broadcast encryption scheme to an adaptive secure broadcast encryption scheme?

There is a generic reduction from breaking selective security of a protocol $\mathsf{P}$ to breaking its adaptive security: the adaptive reduction for $\mathsf{P}$ simply guesses (at random) the ...
ckamath's user avatar
  • 5,378
1 vote

Traitor tracing - codeword properties

General method: Let $X=\{222,112\}$ be a group of two traitors we focus on. Clearly (see my answer to your earlier question) $$\mathrm{desc}(X)=\{1,2\}\times \{1,2\}\times \{2\}=\{222,122,212,112\} $$...
kodlu's user avatar
  • 23k
1 vote
Accepted

Traitor tracing - determining a set of codewords

Note that there are two words in $F$ which disagree on the $k^{th}$ coordinate if and only if $|X(k)|>1.$ All three words in $F$ have $0$ as their first symbol so $X(1)=\{0\}.$ Thus all ...
kodlu's user avatar
  • 23k

Only top scored, non community-wiki answers of a minimum length are eligible