|
ABSTRACT
We introduce a simple primitive called Augmented Broadcast Encryption (ABE) that is sufficient for constructing broadcast encryption, traitor-tracing, and trace-and-revoke systems. These ABE-based constructions are resistant to an arbitrary number of colluders and are secure against adaptive adversaries. Furthermore, traitor tracing requires no secrets and can be done by anyone. These broadcast systems are designed for broadcasting to arbitrary sets of users. We then construct a secure ABE system for which the resulting concrete trace-and-revoke system has ciphertexts and private keys of size √N where N is the total number of users in the system. In particular, this is the first example of a fully collusion resistant broadcast system with sub-linear size ciphertexts and private keys that is secure against adaptive adversaries. The system is publicly traceable.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Omer Berkman , Michal Parnas , Jiři Sgall, Efficient dynamic traitor tracing, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.586-595, January 09-11, 2000, San Francisco, California, United States
|
| |
3
|
|
| |
4
|
Dan Boneh, Craig Gentry, and Brent Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In CRYPTO '05, pages 258--275, 2005.
|
| |
5
|
Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. Evaluating 2-dnf formulas on ciphertexts. In Joe Kilian, editor, Proceedings of Theory of Cryptography Conference 2005, volume 3378 of LNCS, pages 325--342. Springer, 2005.
|
| |
6
|
Dan Boneh, Amit Sahai, and Brent Waters. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In Eurocrypt '06, 2006.
|
| |
7
|
Dan Boneh and Alice Silverberg. Applications of multilinear forms to cryptography. Contemporary Mathematics, 324:71--90, 2003.
|
| |
8
|
Ran Canetti, Shai Halevi, and Jonathan Katz. Chosen-ciphertext security from identity-based encryption. In Proceedings of Eurocrypt 2004, LNCS, pages 207--222, 2004.
|
| |
9
|
Hervé Chabanne, Duong Hieu Phan, and David Pointcheval. Public traceability in traitor tracing schemes. In EUROCRYPT '05, pages 542--558, 2005.
|
| |
10
|
|
| |
11
|
Benny Chor, Amos Fiat, Moni Naor, and Benny Pinkas. Tracing traitors. IEEE Transactions on Information Theory, 46(3): 893--910, 2000.
|
| |
12
|
Yevgeniy Dodis and Nelly Fazio. Public key broadcast encryption for stateless receivers. In Proceedings of the Digital Rights Management Workshop 2002, volume 2696 of LNCS, pages 61--80. Springer, 2002.
|
| |
13
|
|
| |
14
|
|
| |
15
|
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
M. T. Goodrich, J. Z. Sun, , and R. Tamassia. Efficient tree-based revocation in groups of low-state devices. In Proceedings of Crypto '04, volume 2204 of LNCS, 2004.
|
| |
20
|
|
| |
21
|
|
| |
22
|
Aggelos Kiayias and Moti Yung. Breaking and repairing asymmetric public-key traitor tracing. In Joan Feigenbaum, editor, ACM Workshop in Digital Rights Management -- DRM 2002, volume 2696 of Lecture Notes in Computer Science, pages pp. 32--50. Springer, 2002.
|
| |
23
|
K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. In Proceedings of Eurocrypt '98, pages 145--157, 1998.
|
| |
24
|
|
| |
25
|
|
| |
26
|
|
| |
27
|
|
 |
28
|
|
| |
29
|
|
| |
30
|
|
| |
31
|
Jessica N. Staddon, Douglas R. Stinson, and Ruizhong Wei. Combinatorial properties of frameproof and traceability codes. Cryptology ePrint 2000/004, 2000.
|
| |
32
|
|
| |
33
|
|
| |
34
|
|
| |
35
|
|
| |
36
|
|
| |
37
|
|
| |
38
|
|
|