Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Practical minimal perfect hash functions for large databases
Communications of the ACM
A faster algorithm for constructing minimal perfect hash functions
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters
Communication-efficient anonymous group identification
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Anonymous authentication with subset queries (extended abstract)
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Unlinkable serial transactions: protocols and applications
ACM Transactions on Information and System Security (TISSEC)
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
On specifying security policies for web documents with an XML-based language
SACMAT '01 Proceedings of the sixth ACM symposium on Access control models and technologies
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Flexible authentication of XML documents
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A fine-grained access control system for XML documents
ACM Transactions on Information and System Security (TISSEC)
Secure and selective dissemination of XML documents
ACM Transactions on Information and System Security (TISSEC)
Securing XML Documents with Author-X
IEEE Internet Computing
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Design and Security Analysis of Anonymous Group Identification Protocols
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
A secure and private system for subscription-based remote services
ACM Transactions on Information and System Security (TISSEC)
Succinct specifications of portable document access policies
Proceedings of the ninth ACM symposium on Access control models and technologies
Software license management with smart cards
WOST'99 Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology
A trusted decentralized access control framework for the client/server architecture
Journal of Network and Computer Applications
Hi-index | 0.00 |
In this work we address the problem of portable and flexible privacy-preserving access rights for large online data repositories. 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 any customer to choose any subset of items from the repository and correspondingly 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, and therefore the rights must be enforced using the limited resources available.Our main results are solutions to the problem that utilize minimal perfect hash functions and order-preserving minimal perfect hash functions. None of them use expensive cryptography, all require very little space, and they are therefore suitable for computationally weak and space-limited devices such as smartcards, sensors, etc. Performance of the schemes is measured as the probability of false positives (i.e., the probability that access to an unpurchased item will be permitted) for a given storage space bound. Using our techniques, for a data repository of size n and subscription order of m ll n items, we achieve a probability of false positives of m-c using only O(cm) bits of storage space, where c is an adjustable parameter (a constant or otherwise) that can be set to provide the desired performance. This is the first time that such provable bounds are established for this problem, and we believe the techniques we use are of more general interest through the unusual use we make of perfect hashing.