Table of Contents Author Guidelines Submit a Manuscript
Table of Contents Alerts

To receive news and publication updates for The Scientific World Journal, enter your email address in the box below.

The Scientific World Journal
Volume 2013, Article ID 860621, 13 pages
http://dx.doi.org/10.1155/2013/860621
Research Article

Query-Biased Preview over Outsourced and Encrypted Data

Ningduo Peng, Guangchun Luo, Ke Qin, and Aiguo Chen

School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China

Received 14 June 2013; Accepted 16 July 2013

Academic Editors: T.-Y. Chang and C. L. Hsu

Copyright © 2013 Ningduo Peng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Tombros and M. Sanderson, “Advantages of query biased summaries in information retrieval,” in Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pp. 2–10, ACM, 1998.
  2. D. Christopher and P. R. H. S. Manning, Introduction To Information Retrieval, Cambridge University Press, 2008.
  3. J. Goldstein, M. Kantrowitz, V. Mittal, and J. Carbonell, “Summarizing text documents: sentence selection and evaluation metrics,” in Proceedings of 22nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 121–128, 2013.
  4. T. Sakai and K. Sparck-Jones, “Generic summaries for indexing in information retrieval,” in Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 190–198, Association for Computing Machinery, 2001.
  5. A. Turpin, Y. Tsegay, D. Hawking, and H. E. Williams, “Fast generation of result snippets in web search,” in Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '07), pp. 127–134, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. R. W. White, I. Ruthven, and J. M. Jose, “Finding relevant documents using top ranking sentences: an evaluation of two alternative schemes,” in Proceedings of the 25th Annual International Conference on Research and Development in Information Retrieval (ACM SIGIR '02), pp. 57–64, Association for Computing Machinery, 2002.
  7. A. K. Mithal and A. Tayebi, Method and System For Facilitating Search, Selection, Preview, Purchase Evaluation, Offering For Sale, Distribution, and/or Sale of Digital Content and Enhancing the Security Thereof, 2009.
  8. A. Nenkova and K. McKeown, “A survey of text summarization techniques,” in Mining Text Data, pp. 43–76, Springer, 2012. View at Google Scholar
  9. D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proceedings of the IEEE Symposium on Security and Privacy, pp. 44–55, May 2000. View at Scopus
  10. E. J. Goh, “Secure indexes,” Tech. Rep., 2003, IACR ePrint Cryptography Archive, http://eprint.iacr.org/2003/216. View at Google Scholar
  11. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” in Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79–88, ACM Press, November 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. M. Chase and S. Kamara, “Structured encryption and controlled disclosure,” in Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '10), pp. 577–594, Springer, 2010.
  13. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '04), pp. 506–522, Springer, 2004.
  14. M. Abdalla, M. Bellare, D. Catalano et al., “Searchable encryption revisited: consistency properties, relation to anonymous ibe, and extensions,” in Proceedings of the 25th Annual International Cryptology Conference (CRYPTO '05), pp. 205–222, Springer, 2006.
  15. D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, “Public key encryption that allows pir queries,” in Proceedings of the 27th Annual International Cryptology Conference (CRYPTO '07), pp. 50–67, Springer, 2007.
  16. P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Proceedings of the 2nd International Conference (ACNS '04), pp. 31–45, Springer, 2004.
  17. N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over encrypted cloud data,” in IEEE International Conference on Computer Communications (INFOCOM '11), pp. 829–837, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proceedings of the 30th IEEE International Conference on Distributed Computing Systems (ICDCS '10), pp. 253–262, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Swaminathan, Y. Mao, G.-M. Su et al., “Confidentiality-preserving rank-ordered search,” in Proceedings of the ACM Workshop on Storage Security and Survivability (StorageSS '07), pp. 7–12, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. C. Bosch, R. Brinkman, P. Hartel, and W. Jonker, “Conjunctive wildcard search over encrypted data,” in Proceedings of the 8th VLDB Workshop on Secure Data Management, pp. 114–127, Springer, 2011.
  21. J. Bringer and H. Chabanne, “Embedding edit distance to allow private keyword search in cloud computing,” in Proceedings of the 8th FTRA International Conference on Secure and Trust Computing, Data Management, and Application, pp. 105–113, Springer, 2011.
  22. J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy keyword search over encrypted data in cloud computing,” in IEEE Conference on Computer Communications (INFOCOM '10), March 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. W. Cong, R. Kui, Y. Shucheng, and K. M. R. Urs, “Achieving usable and privacy-assured similarity search over outsourced cloud data,” in IEEE Conference on Computer Communications (INFOCOM ' 12), pp. 451–459, IEEE, 2012.
  24. M. Kuzu, M. S. Islam, and M. Kantarcioglu, “Efficient similarity search over encrypted data,” in IEEE 28th International Conference on Data Engineering (ICDE '12), pp. 1156–1167.
  25. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 26, no. 1, pp. 96–99, 1983. View at Publisher · View at Google Scholar · View at Scopus
  26. A. K. Singh and P. Chandran, “A secure and efficient multi-authority proactive election scheme,” in Proceedings of the 3rd International Conference Information Systems Security (ICISS '07), pp. 208–218, 2007.
  27. S. Goldwasser and S. Micali, “Probabilistic encryption & how to play mental poker keeping secret all partial information,” in Annual ACM Symposium on Theory of Computing, pp. 365–377, ACM, 1982. View at Google Scholar
  28. S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270–299, 1984. View at Google Scholar · View at Scopus
  29. P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '99), pp. 223–238, 1999.
  30. C. Castelluccia, E. Mykletun, and G. Tsudik, “Efficient aggregation of encrypted data in wireless sensor networks,” in Proceedings of the 2nd Annual International Conference on Mobile and Ubiquitous Systems-Networking and Services, pp. 109–117, July 2005. View at Publisher · View at Google Scholar · View at Scopus
  31. C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC '09), pp. 169–178, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers,” in Lecture Notes in Computer Science, pp. 24–43, 2010. View at Google Scholar
  33. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” Journal of the ACM, vol. 45, no. 6, pp. 965–982, 1998. View at Publisher · View at Google Scholar · View at Scopus
  34. E. Kushilevitz and R. Ostrovsky, “Replication is not needed: single database, computationally-private information retrieval,” in Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science, pp. 364–373, October 1997. View at Scopus
  35. C. Cashin, S. Micali, and M. Stadler, “Computationally private information retrieval with polylogarithmic communication,” in International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '99), pp. 402–414, Springer, 1999.
  36. C. Gentry and Z. Ramzan, “Single-database private information retrieval with constant communication rate,” in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP '05), pp. 803–815, July 2005. View at Scopus
  37. H. P. Luhn, “A statistical approach to mechanized encoding and searching of literary information,” in Pioneer of Information Science, Selected Works, pp. 94–104, 1969. View at Google Scholar
  38. C. Fox, “Lexical analysis and stop-lists,” in Information Retrieval: Data Structures and Algorithms, 1992. View at Google Scholar
  39. R. L. Rivest and R. W. Baldwin, “The rc5, rc5-cbc, rc5-cbc-pad, and rc5-cts algorithms,” in The Internet Engineering Task Force Request For Comments, 1996. View at Google Scholar
  40. M. Davies, Word frequency data, 2012, http://www.wordfrequency.info.
  41. M. L. Fredman, E. Szemeredi, and J. Komlos, “Storing a sparse table with o(1) worst case access time,” Journal of the ACM, vol. 31, no. 3, pp. 538–544, 1984. View at Publisher · View at Google Scholar · View at Scopus
  42. S. Kamara, C. Papamanthou, and T. Roeder, “Cs2: a searchable cryptographic cloud storage system,” Tech. Rep. MSR-TR-2011-58, Microsoft Research, 2011. View at Google Scholar