| Broadcast encryption with short keys and transmissions |
| Full text |
Pdf
(269 KB)
|
| Source
|
ACM Workshop On Digital Rights Management
archive
Proceedings of the 3rd ACM workshop on Digital rights management
table of contents
Washington, DC, USA
SESSION: Supporting cryptographic technology
table of contents
Pages: 55 - 66
Year of Publication: 2003
ISBN:1-58113-786-9
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 15, Downloads (12 Months): 76, Citation Count: 3
|
|
|
ABSTRACT
Broadcast Encryption allows a broadcaster to broadcast an encrypted message so that only a dynamically changing designated group of users can decrypt it. The stateless setting considers the case where the private key at each user is never updated. A central open problem in this area is to design a stateless scheme where both the size of transmission header which encapsulates the session key and the size of private key at each user are small and independent of the number of users (all/privileged/revoked users). We propose schemes that meet this requirement by providing a tradeoff between security against collusion and non-secret storage size. The proposed schemes are based upon new notions of one-way accumulators which are of independent interest.
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
|
N. Attrapadung, K. Kobara, H. Imai, "Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes", ASIACRYPT 2003, To appear.
|
| |
3
|
|
 |
4
|
|
| |
5
|
C. Blundo and A. Cresti. "Space Requirements for Broadcast Encryption", EUROCRYPT 1994, LNCS 950, pp. 287--298.
|
| |
6
|
|
| |
7
|
|
| |
8
|
N. Baric and B. Pfitzmann,"Collision-free accumulators and fail-stop signature schemes without trees", EUROCRYPT 1997, LNCS 1233, pp. 480--494.
|
| |
9
|
D. Boneh and A. Silverberg, "Applications of Multilinear Forms to Cryptography", 2002. Available from http://eprint.iacr.org.
|
| |
10
|
|
| |
11
|
|
 |
12
|
|
| |
13
|
|
| |
14
|
Y. Dodis and N.Fazio, "Public Key Broadcast Encryption for Stateless Receivers", ACM Workshop on Digital Rights Management, November 2002.
|
| |
15
|
|
 |
16
|
Yevgeniy Dodis , Nelly Fazio , Aggelos Kiayias , Moti Yung, Scalable public-key tracing and revoking, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.190-199, July 13-16, 2003, Boston, Massachusetts
[doi> 10.1145/872035.872062]
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
M. Luby, J. Staddon, "Combinatorial Bounds for Broadcast Encryption", EUROCRYPT 1998, LNCS 1403, pp. 512--526.
|
| |
24
|
|
| |
25
|
|
| |
26
|
|
| |
27
|
|
 |
28
|
Chung Kei Wong , Mohamed Gouda , Simon S. Lam, Secure group communications using key graphs, Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, p.68-79, August 31-September 04, 1998, Vancouver, British Columbia, Canada
|
| |
29
|
D. Wallner, E. Harder and R. Agee, "Key Management for Multicast: Issues and Architectures", IETF NetworkWorking Group, Request for Comments: 2627, available from ftp://ftp.ietf.org/rfc/rfc2627.txt, 1999.
|
CITED BY 3
|
|
Alexandr Andoni , Jessica Staddon, Graceful service degradation (or, how to know your payment is late), Proceedings of the 6th ACM conference on Electronic commerce, p.9-18, June 05-08, 2005, Vancouver, BC, Canada
|
|
|
Keith Frikken , Mikhail Atallah , Marina Bykova, Remote revocation of smart cards in a private DRM system, Proceedings of the 2005 Australasian workshop on Grid computing and e-research, p.169-177, January 01, 2005, Newcastle, New South Wales, Australia
|
|
|
|
|