Name
Abstract | ||
|---|---|---|
We propose a hierarchical key-assignment method to reduce the ciphertext size in a black-box tracing scheme presented at ASIACRYPT 2004. Applying the proposed method to this scheme, the ciphertext size is reduced from to O(k+log(n/k)) without a substantial increase in the decryption-key size, where k,n denote the maximum number of colluders in a coalition and the total number of receivers respectively. The resulting scheme also supports black-box tracing and enjoys the following properties: Even if a pirate decoder does not respond any further queries when it detects itself being examined, the pirate decoder can be traced back to a person who participated in its construction. A tracer's key, which is necessary for black-box tracing, is public. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11935308_8 | ICICS |
Keywords | Field | DocType |
hierarchical key-assignment method,total number,following property,decryption-key size,resulting scheme,hierarchical key assignment,efficient ciphertext size,ciphertext size,pirate decoder,maximum number,substantial increase | Black box (phreaking),Database query,Computer science,Cryptography,Algorithm,Key assignment,Ciphertext,Tracing | Conference |
Volume | ISSN | ISBN |
4307 | 0302-9743 | 3-540-49496-0 |
Citations | PageRank | References |
2 | 0.40 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tatsuyuki Matsushita | 1 | 28 | 3.47 |
| Hideki Imai | 2 | 2 | 0.40 |