publication . Preprint . 2017

A Searchable Symmetric Encryption Scheme using BlockChain

Li, Huige; Zhang, Fangguo; He, Jiejie; Tian, Haibo;
Open Access English
  • Published: 03 Nov 2017
Abstract
At present, the cloud storage used in searchable symmetric encryption schemes (SSE) is provided in a private way, which cannot be seen as a true cloud. Moreover, the cloud server is thought to be credible, because it always returns the search result to the user, even they are not correct. In order to really resist this malicious adversary and accelerate the usage of the data, it is necessary to store the data on a public chain, which can be seen as a decentralized system. As the increasing amount of the data, the search problem becomes more and more intractable, because there does not exist any effective solution at present. In this paper, we begin by pointing o...
Subjects
free text keywords: Computer Science - Cryptography and Security
Related Organizations
Download from
36 references, page 1 of 3

1. Alderman, J., Martin, K.M., Renwick, S.L.: Multi-level access in searchable symmetric encryption (2017), http:// eprint.iacr.org/2017/211 [OpenAIRE]

2. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Fair two-party computations via bitcoin deposits. In: International Conference on Financial Cryptography and Data Security. pp. 105-121. Springer (2014) [OpenAIRE]

3. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy. pp. 443-458. IEEE (2014) [OpenAIRE]

4. Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: International Cryptology Conference. pp. 421-439. Springer (2014) [OpenAIRE]

5. Boldyreva, A., Chenette, N.: Efficient fuzzy search on encrypted data. In: Fast Software Encryption. pp. 613-633. Springer (2014)

6. B¨osch, C., Hartel, P., Jonker, W., Peter, A.: A survey of provably secure searchable encryption. ACM Computing Surveys (CSUR) 47(2), 18 (2015)

7. Bost, R.: oϕoς: Forward secure searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. pp. 1143-1154. ACM (2016) [OpenAIRE]

8. Bost, R., Fouque, P., Pointcheval, D.: Verifiable dynamic symmetric searchable encryption: Optimality and forward security. IACR Cryptology ePrint Archive 2016, 62 (2016), http://eprint.iacr.org/2016/062

9. Buterin, V., et al.: A next-generation smart contract and decentralized application platform. white paper. https://github.com/ethereum/wiki/wiki/White-Paper

10. Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact e-cash. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 302-321. Springer (2005) [OpenAIRE]

11. 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), 222-233 (2014)

12. Cash, D., Jaeger, J., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M.C., Steiner, M.: Dynamic searchable encryption in very-large databases: Data structures and implementation. In: NDSS. vol. 14, pp. 23-26. Citeseer (2014)

13. Cash, D., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Advances in Cryptology-CRYPTO 2013, pp. 353-373. Springer (2013) [OpenAIRE]

14. Chaum, D.: Blind signatures for untraceable payments. In: Advances in cryptology. pp. 199-203. Springer (1983) [OpenAIRE]

15. Chaum, D.: Blind signature system. In: Advances in cryptology. pp. 153-153. Springer (1984) [OpenAIRE]

36 references, page 1 of 3
Abstract
At present, the cloud storage used in searchable symmetric encryption schemes (SSE) is provided in a private way, which cannot be seen as a true cloud. Moreover, the cloud server is thought to be credible, because it always returns the search result to the user, even they are not correct. In order to really resist this malicious adversary and accelerate the usage of the data, it is necessary to store the data on a public chain, which can be seen as a decentralized system. As the increasing amount of the data, the search problem becomes more and more intractable, because there does not exist any effective solution at present. In this paper, we begin by pointing o...
Subjects
free text keywords: Computer Science - Cryptography and Security
Related Organizations
Download from
36 references, page 1 of 3

1. Alderman, J., Martin, K.M., Renwick, S.L.: Multi-level access in searchable symmetric encryption (2017), http:// eprint.iacr.org/2017/211 [OpenAIRE]

2. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Fair two-party computations via bitcoin deposits. In: International Conference on Financial Cryptography and Data Security. pp. 105-121. Springer (2014) [OpenAIRE]

3. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy. pp. 443-458. IEEE (2014) [OpenAIRE]

4. Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: International Cryptology Conference. pp. 421-439. Springer (2014) [OpenAIRE]

5. Boldyreva, A., Chenette, N.: Efficient fuzzy search on encrypted data. In: Fast Software Encryption. pp. 613-633. Springer (2014)

6. B¨osch, C., Hartel, P., Jonker, W., Peter, A.: A survey of provably secure searchable encryption. ACM Computing Surveys (CSUR) 47(2), 18 (2015)

7. Bost, R.: oϕoς: Forward secure searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. pp. 1143-1154. ACM (2016) [OpenAIRE]

8. Bost, R., Fouque, P., Pointcheval, D.: Verifiable dynamic symmetric searchable encryption: Optimality and forward security. IACR Cryptology ePrint Archive 2016, 62 (2016), http://eprint.iacr.org/2016/062

9. Buterin, V., et al.: A next-generation smart contract and decentralized application platform. white paper. https://github.com/ethereum/wiki/wiki/White-Paper

10. Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact e-cash. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 302-321. Springer (2005) [OpenAIRE]

11. 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), 222-233 (2014)

12. Cash, D., Jaeger, J., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M.C., Steiner, M.: Dynamic searchable encryption in very-large databases: Data structures and implementation. In: NDSS. vol. 14, pp. 23-26. Citeseer (2014)

13. Cash, D., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Advances in Cryptology-CRYPTO 2013, pp. 353-373. Springer (2013) [OpenAIRE]

14. Chaum, D.: Blind signatures for untraceable payments. In: Advances in cryptology. pp. 199-203. Springer (1983) [OpenAIRE]

15. Chaum, D.: Blind signature system. In: Advances in cryptology. pp. 153-153. Springer (1984) [OpenAIRE]

36 references, page 1 of 3
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue