@conference {15904,
	title = {Confidentiality-preserving rank-ordered search},
	booktitle = {Proceedings of the 2007 ACM workshop on Storage security and survivability},
	series = {StorageSS {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {7 - 12},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper introduces a new framework for confidentiality preserving rank-ordered search and retrieval over large document collections. The proposed framework not only protects document/query confidentiality against an outside intruder, but also prevents an untrusted data center from learning information about the query and the document collection. We present practical techniques for proper integration of relevance scoring methods and cryptographic techniques, such as order preserving encryption, to protect data collections and indices and provide efficient and accurate search capabilities to securely rank-order documents in response to a query. Experimental results on the W3C collection show that these techniques have comparable performance to conventional search systems designed for non-encrypted data in terms of search accuracy. The proposed methods thus form the first steps to bring together advanced information retrieval and secure search capabilities for a wide range of applications including managing data in government and business operations, enabling scholarly study of sensitive data, and facilitating the document discovery process in litigation.},
	keywords = {encrypted domain search, Ranked retrieval, secure index},
	isbn = {978-1-59593-891-6},
	doi = {10.1145/1314313.1314316},
	url = {http://doi.acm.org/10.1145/1314313.1314316},
	author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas}
}
