A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Probabilistic models in information retrieval
The Computer Journal - Special issue on information retrieval
A systematic approach to compressing a full-text retrieval system
Information Processing and Management: an International Journal - Special issue on data compression for images and texts
Adding compression to a full-text retrieval system
Software—Practice & Experience
Role-Based Access Control Models
Computer
A semidiscrete matrix decomposition for latent semantic indexing information retrieval
ACM Transactions on Information Systems (TOIS)
Communications of the ACM
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Probabilistic latent semantic indexing
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
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
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
Information Retrieval
Modern Information Retrieval
Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
An Efficient and Practical Scheme for Privacy Protection in the E-Commerce of Digital Goods
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
On the use of the singular value decomposition for text retrieval
Computational information retrieval
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Balancing confidentiality and efficiency in untrusted relational DBMSs
Proceedings of the 10th ACM conference on Computer and communications security
Journal of Complexity - Special issue on coding and cryptography
RCV1: A New Benchmark Collection for Text Categorization Research
The Journal of Machine Learning Research
Order preserving encryption for numeric data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Locality preserving indexing for document representation
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
On the complexity of optimal K-anonymity
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Privacy-enhancing k-anonymization of customer data
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
\ell -Diversity: Privacy Beyond \kappa -Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
New Constructions and Practical Applications for Private Stream Searching (Extended Abstract)
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
SIAM Journal on Computing
Personalized privacy preservation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Proceedings of the 1st international conference on Mobile systems, applications and services
Minimum-cost network hardening using attack graphs
Computer Communications
Minimizing Information Loss and Preserving Privacy
Management Science
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Privacy protection in personalized search
ACM SIGIR Forum
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
IEEE Transactions on Knowledge and Data Engineering
Privacy-preserving indexing of documents on the network
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Private Searching on Streaming Data
Journal of Cryptology
Augmenting the power of LSI in text retrieval: Singular value rescaling
Data & Knowledge Engineering
Privacy homomorphisms for social networks with private relationships
Computer Networks: The International Journal of Computer and Telecommunications Networking
Steganographic Schemes for File System and B-Tree
IEEE Transactions on Knowledge and Data Engineering
Authenticating the query results of text search engines
Proceedings of the VLDB Endowment
Similar Document Detection with Limited Information Disclosure
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Private information retrieval using trusted hardware
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Embellishing text search queries to protect user privacy
Proceedings of the VLDB Endowment
Privacy-aware DaaS services composition
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Towards the taxonomy-oriented categorization of yellow pages queries
ACM Transactions on Internet Technology (TOIT)
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
When Amazon Meets Google: Product Visualization by Exploring Multiple Web Sources
ACM Transactions on Internet Technology (TOIT)
| Hi-index | 0.00 |
Users of online services are increasingly wary that their activities could disclose confidential information on their business or personal activities. It would be desirable for an online document service to perform text retrieval for users, while protecting the privacy of their activities. In this article, we introduce a privacy-preserving, similarity-based text retrieval scheme that (a) prevents the server from accurately reconstructing the term composition of queries and documents, and (b) anonymizes the search results from unauthorized observers. At the same time, our scheme preserves the relevance-ranking of the search server, and enables accounting of the number of documents that each user opens. The effectiveness of the scheme is verified empirically with two real text corpora.