Revocation and Tracing Schemes for Stateless Receivers

Revocation and Tracing Schemes for Stateless Receivers (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dalit Naor , Moni Naor , Jeff Lotspiech

Citations:

135 - 4 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Revocation and Tracing Schemes for Stateless Receivers	INFERENCE
AUTHOR NAME	Dalit Naor	SVM HeaderParse 0.2
AUTHOR AFFIL	1 IBM Almaden Research Center	SVM HeaderParse 0.2
AUTHOR ADDR	650 Harry Road, San-Jose, CA. 95120	SVM HeaderParse 0.2
AUTHOR NAME	Moni Naor	SVM HeaderParse 0.2
AUTHOR AFFIL	2 Department of Computer Science and Applied Math; Weizmann Institute, Rehovot Israel.	SVM HeaderParse 0.2
AUTHOR NAME	Jeff Lotspiech	SVM HeaderParse 0.2
AUTHOR AFFIL	1 IBM Almaden Research Center	SVM HeaderParse 0.2
AUTHOR ADDR	650 Harry Road, San-Jose, CA. 95120	SVM HeaderParse 0.2
ABSTRACT	Abstract. We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not (necessarily) update their state from session to session. We present a framework called the Subset-Cover framework, which abstracts a variety of revocation schemes including some previously known ones. We provide sufficient conditions that guarantees the security of a revocation algorithm in this class. We describe two explicit Subset-Cover revocation algorithms; these algorithms are very flexible and work for any number of revoked users. The schemes require storage at the receiver of log N and 1 2 log2 N keys respectively (N is the total number of users), and in order to revoke r users the required message lengths are of r log N and 2r keys respectively. We also provide a general traitor tracing mechanism that can be integrated with any Subset-Cover revocation scheme that satisfies a “bifurcation property”. This mechanism does not need an a priori bound on the number of traitors and does not expand the message length by much compared to the revocation of the same set of traitors. The main improvements of these methods over previously suggested methods, when adopted to the stateless scenario, are: (1) reducing the message length to O(r) regardless of the coalition size while maintaining a single decryption at the user’s end (2) provide a seamless integration between the revocation and tracing so that the tracing mechanisms does not require any change to the revocation algorithm.	SVM HeaderParse 0.2
YEAR	2001	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	41--62	INFERENCE
VOLUME	2139	INFERENCE
CITATIONS	28 found	ParsCit 1.0