Memory leakage-resilient searchable symmetric encryption

Future Generation Computer Systems

Volumn 62, Issue , 2016, Pages 76-84

  Dai, Shuguang ^a,b   Li, Huige ^a,b   Zhang, Fangguo ^a,b  

^a SUN YAT SEN UNIVERSITY   (China)

^b Laboratory of Quantum Information Technology of Guangdong Province   (China)

Author keywords

Cloud computing; Memory leakage resilient; Physical unclonable functions (PUFs); Searchable symmetric encryption; Side channel attacks

Indexed keywords

ACCESS CONTROL; CLOUD COMPUTING; CRYPTOGRAPHY; DATA PRIVACY; HARDWARE SECURITY;

ADAPTIVE DYNAMICS; CLOUD SERVERS; FORMAL DEFINITION; ILLEGAL ACCESS; SEARCHABLE ENCRYPTIONS; SECRET KEY; SECURITY DEFINITIONS; SYMMETRIC ENCRYPTION;

SIDE CHANNEL ATTACK;

EID: 84950146701     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2015.11.003     Document Type: Article

References (28)

1. [1] Sun, W., Lou, W., Hou, Y.T., Li, H., Privacy-preserving keyword search over encrypted data in cloud computing. Jajodia, S., Kant, K., Samarati, P., Singhal, A., Swarup, V., Wang, C., (eds.) Secure Cloud Computing 2014, 2014, Springer, New York, 189–212.
2. [2] Song, D.X., Wagner, D., Perrig, A., Practical techniques for searches on encrypted data. 2000 IEEE Symposium on Security and Privacy, 2000, IEEE Computer Society Press, 44–55.
3. [3] Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Public key encryption with keyword search. Cachin, C., Camenisch, J.L., (eds.) EUROCRYPT 2004 LNCS, vol. 3027, 2004, Springer, Heidelberg, 506–522.
4. [4] E.-J. Goh, Secure indexes. Cryptology ePrint Archive, Report 2003/216, 2003. http://eprint.iacr.org/.
5. [5] Bloom, B.H., Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13:7 (1970), 422–426.
6. [6] Chang, Y.C., Mitzenmacher, M., Privacy preserving keyword searches on remote encrypted data. Ioannidis, J., Keromytis, A., Yung, M., (eds.) ACNS 2005 LNCS, vol. 3531, 2005, Springer, Heidelberg, 442–455.
7. [7] Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R., Searchable symmetric encryption: improved definitions and efficient constructions. ACM CCS 2006, 2006, ACM, 79–88.
8. [8] Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M., Steiner, M., Dynamic searchable encryption in very large databases: Data structures and implementation. NDSS’14, 2014.
9. [9] Kamara, S., Papamanthou, C., Roeder, T., Dynamic searchable symmetric encryption. ACM CCS 2012, 2012, ACM, 965–976.
10. [10] Stefanov, E., Papamanthou, C., Shi, E., Practical dynamic searchable encryption with small leakage. NDSS’14, 2014.
11. [11] Chase, M., Kamara, S., Structured encryption and controlled disclosure. Abe, M., (eds.) ASIACRYPT 2010 LNCS, vol. 6477, 2010, Springer, Heidelberg, 577–594.
12. [12] Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.C., Steiner, M., Outsourced symmetric private information retrieval. ACM CCS 2013, 2013, ACM, 875–887.
13. [13] Golle, P., Staddon, J., Waters, B.R., Secure conjunctive keyword search over encrypted data. Jakobsson, M., Yung, M., Zhou, J., (eds.) ACNS 2004 LNCS, vol. 3089, 2004, Springer, Heidelberg, 31–45.
14. [14] Cash, D., Jarecki, S., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M., Steiner, M., Highly-scalable searchable symmetric encryption with support for boolean queries. Canetti, R., Garay, J.A., (eds.) CRYPTO 2013 LNCS, vol. 8042, 2013, Springer, Heidelberg, 353–373.
15. [15] Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., Lou, W., Fuzzy keyword search over encrypted data in cloud computing. INFOCOM 2010, 2010, IEEE, 1–5.
16. [16] Wang, C., Ren, K., Yu, S., Mahendra, K., Achieving usable and privacy-assured similarity search over out-sourced cloud data. Proceedings of the 31th IEEE International Conference on Computer Communications, INFOCOM’12, 2012, IEEE, 451–459.
17. [17] Cao, N., Wang, C., Li, M., Ren, K., Lou, W., Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 25:1 (2014), 222–233.
18. [18] Biham, E., Shamir, A., Differential fault analysis of secret key cryptosystems. Kaliski, B.S., (eds.) CRYPTO 1997 LNCS, vol. 1294, 1997, Springer, Heidelberg, 513–525.
19. [19] J.A. Halderman, S.D. Schoen, N. Heninger, W. Clarkson, W. Paul, J.A. Calandrino, A.J. Feldman, J. Appelbaum, E.W. Felten, Lest we remember: Cold boot attacks on encryption keys, in: USENIX Security Symposium 2008, 2008, pp. 45-60.
20. [20] Koccher, P.C., Timing attacks on implementations of diffie-hellman, rsa, dss, and other systems. Koblitz, N., (eds.) CRYPTO 1996 LNCS, vol. 1109, 1996, Springer, Heidelberg, 104–113.
21. [21] Kocher, P.C., Jaffe, J., Jun, B., Differential power analysis. Wiener, M., (eds.) CRYPTO 1999 LNCS, vol. 1666, 1999, Springer, Heidelberg, 388–397.
22. [22] J.-J. Quisquater, D. Samyde, Electromagnetic analysis (ema): Measures and counter-measures for smart cards, in: E-smart 2001, 2001, pp. 200–210.
23. [23] Pappu, R.S., Recht, B., Taylor, J., Gershenfeld, N., Physical one-way functions. Science 297 (2002), 2026–2030.
24. [24] Brzuska, C., Fischlin, M., Schröder, H., Katzenbeisser, S., Physically uncloneable functions in the universal composition framework. Rogaway, P., (eds.) CRYPTO 2011 LNCS, vol. 6841, 2011, Springer, Heidelberg, 51–70.
25. [25] Akavia, A., Goldwasser, S., Vaikuntanathan, V., Simultaneous hardcore bits and cryptography against memory attacks. Reingold, O., (eds.) TCC 2009 LNCS, vol. 5444, 2009, Springer, Heidelberg, 474–495.
26. [26] Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A., Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38:1 (2008), 97–139.
27. [27] Armknecht, F., Maes, R., Sadeghi, A.-R., Sunar, B., Tuyls, P., Memory leakage-resilient encryption based on physically unclonable functions. Matsui, M., (eds.) ASIACRYPT 2009 LNCS, vol. 5912, 2009, Springer, Heidelberg, 685–702.
28. [28] van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V., Fully homomorphic encryption over the integers. Proceedings of EuroCrypt Lecture Notes in Computer Science, vol. 6110, 2010, 24–43.