The Research And Implement Of Proxy Re-encryption With Keyword Search Scheme

With the rapid development of cloud computing technology in the global field, the user will store a large number of complex data in the cloud platform. Although the cloud storage provides a lot of convenience to the user, the security and privacy problems hindering the cloud computing technology has been widely applied. In order to improve the safety and protection of the privacy of user cloud data storage, data encryption of how to efficiently search queries with keyword search has become an active research topic in cryptography.In this paper, we give the definition and security model of PRES with a designated tester (dPRES) and present an efficient dPRES scheme which is proven under CCA-secure in the adaptive corruption model without resorting to random oracle. Our dPRES scheme obtains three advantages:firstly, when a user transmits the trapdoor of keyword to his designated tester, the user does not use a secure channel; secondly, our dPRES scheme resists keyword off-line guessing attacks; thirdly, we propose a dPRES scheme against an adaptive chosen keyword with no attached strongly-unforgeable one-time signature so that our dPRES scheme is more efficient. This paper also involves bilinear mapping computation algorithm using java language to code, specifically including:the elements are equal judgment, hash value, plus its own operating basis, calculated by adding achieve curve element linear elliptic curve points the program calculates the specific mapping, large integer arithmetic functions, such as tools to achieve functions. Deployed to the actual practical application of cloud computing, e-mail service system for the new program provides a convenient structure.