Shared and searchable encrypted data for untrusted servers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5094 LNCS, Issue , 2008, Pages 127-143

  Dong, Changyu ^a   Russello, Giovanni ^a   Dulay, Naranker ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INDUSTRIAL ECONOMICS; KEYS (FOR LOCKS); MANAGEMENT INFORMATION SYSTEMS; OCCUPATIONAL RISKS; ONLINE SEARCHING; SERVERS; INFORMATION MANAGEMENT; MOBILE SECURITY; QUERY PROCESSING; SEARCH ENGINES;

COMPUTATION OVERHEADS; CRYPTOGRAPHIC SCHEMES; DATA MANAGEMENT; ENCRYPTED DATA; ENCRYPTION SCHEMES; FORMAL PROOFS; KEY REVOCATION; KEYWORD SEARCHES; MULTIPLE USERS; OUT SOURCING; PROTOTYPE IMPLEMENTATIONS; RE-ENCRYPTION; SECRET KEYS; SECURITY MECHANISMS; SENSITIVE DATA; SINGLE-USER; UNTRUSTED SERVERS;

PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

COMPUTATION OVERHEADS; CRYPTOGRAPHIC SCHEMES; DATABASE TABLES; ENCRYPTION SCHEMES; PROTOTYPE IMPLEMENTATIONS; SECURITY MECHANISM; SENSITIVE DATAS; UNTRUSTED SERVER;

EID: 50249137692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70567-3_10     Document Type: Conference Paper

References (26)

1. Blackwood, J.: Is storage outsourcing a viable alternative? http://techupdate.zdnet.com/techupdate/stories/main/0,14179,2851289,00.html
2. Connor, D.: Storage outsourcing on the rise, http://www.networkworld.com/ news/2007/012207-storage-outsourcing-rises.html
3. Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44-55 (2000)
4. Yang, Z., Zhong, S., Wright, R.N.: Privacy-Preserving Queries on Encrypted Data. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 479-495. Springer, Heidelberg (2006)
5. Goh, E.J.: Secure indexes. Cryptology ePrint Archive, Report 2003/216 (2003), http://eprint.iacr.org/2003/216/
6. Hacigümüs, H., Iyer, B.R., Li, C., Mehrotra, S.: Executing sql over encrypted data in the database-service-provider model. In: SIGMOD Conference, pp. 216-227 (2002)
7. Damiani, E., di Vimercati, S.D.C., Jajodia, S., Paraboschi, S., Samarati, P.: Balancing confidentiality and efficiency in untrusted relational dbmss. In: ACM Conference on Computer and Communications Security, pp. 93-102 (2003)
8. Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order-preserving encryption for numeric data. In: SIGMOD Conference, pp. 563-574 (2004)
9. Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: VLDB, pp. 720-731 (2004)
10. Boneh, D., Crescenzo, G.D., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004)
11. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: ACM Conference on Computer and Communications Security, pp. 79-88 (2006)
12. Blaze, M., Bleumer, G., Strauss, M.: Divertible Protocols and Atomic Proxy Cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127-144. Springer, Heidelberg (1998)
13. Elgamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31(4), 469-472 (1985)
14. Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120-126 (1978)
15. Khurana, H., Slagell, A.J., Bonilla, R.: Sels: a secure e-mail list service. In: SAC, pp. 306-313 (2005)
16. Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. In: NDSS (2005)
17. Kapadia, A., Tsang, P.P., Smith, S.W.: Attribute-based publishing with hidden credentials and hidden policies. In: NDSS (2007)
18. Ivan, A.A., Dodis, Y.: Proxy cryptography revisited. In: NDSS (2003)
19. Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. II. Cambridge University Press, Cambridge (2004)
20. Simmons, G.J.: A "weak" privacy protocol using the rsa crypto algorithm. Cryptologia 7(2), 180-182 (1983)
21. Delaurentis, J.M.: A further weakness in the common modulus protocol for the rsa cryptoalgorithm. Cryptologia 8(3), 253-259 (1984)
22. Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92-111. Springer, Heidelberg (1995)
23. Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP Is Secure under the RSA Assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 260-274. Springer, Heidelberg (2001)
24. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS, pp. 41-50 (1995)
25. Cachin, C., Micali, S., Stadler, M.: Computationally Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402-414. Springer, Heidelberg (1999)
26. Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803-815. Springer, Heidelberg (2005)