Annals of Computer Science and Information Systems, Volume 14

DOI: http://dx.doi.org/10.15439/2017KM38

Citation: Proceedings of the 2017 International Conference on Information Technology and Knowledge Management, Ajay Jaiswal, Vijender Kumar Solanki, Zhongyu (Joan) Lu, Nikhil Rajput (eds). ACSIS, Vol. 14, pages 125–129 (2017)

Full text

Abstract. In display, Cloud registering is the prevailing area in data innovation. With expanded value of information outsourcing of cloud information protection of delicate information turns into a major issue. For the security reason information is encoded before outsourcing. Yet, scrambled information is exceptionally hard to be recovered proficiently. Albeit some conventional scan plans are accessible for looking encoded information, yet these methods are just base on Boolean pursuit and not manage the importance of records. These methodologies experience the ill effects of two principle inadequacies. Right off the bat, on the off chance that one client has no pre-learning of scrambled information, needs to process each recovered record to discover after effects of his utilization. Also, every time recovering every one of the records containing question watchword builds arrange movement. This work is devoted to build up a process for security and compelling recovery of cloud information. Positioned seek enormously enhances the execution by restoring the documents in positioned arrange in light of some closeness importance criteria. To accomplish more viable execution, framework shows an approach for SSE which uses data recovery and cryptography primitives. Thus the execution depends OPSE.

References

1. Song D X, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. Proceedings of IEEE Symposium on Security and Privacy, IEEE, Berkeley, California .
2. Goh E-J (2003) Secure indexes. Cryptology ePrint Archive, Report 2003/216
3. Boneh D, Cresecenzo G, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. Advances in Cryptology- Eurocrypt3027: 506-522.
4. Chang Y C, Mitzenmacher M (2005) Privacy preserving keyword searches on remote encrypted data. Applied Cryptography and Network Security 3531: 442-455.
5. Chang Y C, Mitzenmacher M (2005) Privacy preserving keyword searches on remote encrypted data. Applied Cryptography and Network Security 3531: 442-455.
6. Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: improved definitions and efficient constructions. Proceedings of the 13th ACM conference on Computer and communications security, ACM, Alexandria, VA, USA.
7. Bellare M, Boldyreva A, O’Neill A (2007) Deterministic and efficiently searchable encryption. In Advances in Cryptology-CRYPTO4622: 535-552.
8. Wang C, Cao N, Li J, Ren K, Lou W (2010) Secure ranked keyword search over encrypted cloud data.30th IEEE International Conference on Distributed Computing Systems (ICDCS), IEEE Comp Society Washington, DC, USA.
9. Wang C, Cao N, Ren K, Lou W (2012) Enabling secure and efficient ranked keyword search over outsourced cloud data. IEEE Trans Parallel DistribSyst 23:1467-1479.