Earticle

초록

영어

Today, Cloud computing is becoming a household technology. In cloud, a shared pool of computing resources can be accessed on demand through internet and web applications. Since outsourced data is in third party premises i.e. cloud, accountability of user data is paramount. To preserve privacy and security of user data in cloud, many cryptographic techniques have been proposed by many scientists. One among them is searchable encryption. Searchable encryption allows secure search over encrypted data. In our system, a noble approach has been made using the Elliptic Curve Cryptography (ECC), a cryptographic techniques to reduce the overall computation overhead. Dynamic B+ tree data structure is used to perform multi-keyword search over the encrypted data. To retrieve appropriate data files, ranking will be done based on relevance score. Finally, we compare the effectiveness and efficiency of our proposed scheme with our previous work on CRSA/B+ tree through extensive experimental evaluation using Microsoft azure platform.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Problem Formulation
 4. SE Framework Using ECC/B+ Tree
  4.1. Encryption Framework Using ECC
 5. Results
 6. Conclusion
 References

키워드

저자

• Prasanna B T [ EPCET, Bengaluru, SJBIT, Bengaluru ]
• C B Akki [ EPCET, Bengaluru, SJBIT, Bengaluru ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605