Marina Blanton, Mikhail Atallah

CERIAS TR 2006-54

article

We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access control means that the service provider can neither learn what access rights a customer has nor link a request to access an item to a particular customer, thus maintaining privacy of both customer activity and customer access rights. Flexible access rights allow a customer to choose a subset of items or groups of items from the repository, obtain access to and be charged only for the items selected. And portability of access rights means that the rights themselves can be stored on small devices of limited storage space and computational capabilities such as smartcards or sensors, and therefore the rights must be enforced using the limited re- sources available. In this paper, we present and compare two schemes that address the problem of such access rights. We show that much can be achieved if one allows for even a negligible amount of false positives

PDF

2006 – 11

Special Issue (Privacy-Preserving Data Management) of the International Journal on Very Large Data Bases (VLDBJ)

Blanton

4

15

Purdue University

2006-11-01

1. Introduction 2. Related Work 3. Problem Specifications 4. Permutation-based Approach 5. Approach Based on Minimal Perfect Hash Functions 6. Comparison of the Schemes

Compact representation, privacy-preserving access rights, flexible access rights

English

Succinct Representation of Flexible and Privacy-Preserving Access Rights