PRTA: A Proxy Re-encryption based Trusted Authorization scheme for nodes on CloudIoT

Abstract

In CloudIoT platform, the data is collected and shared by different nodes of Internet of Things(IoT), and data is processed and stored based on cloud servers.It has increased the abilities of IoT on information computation. Meanwhile, it also has enriched the resource in cloud and improved integration of the Internet and human world. All of this offer advantages as well as the new challenges of information security and privacy protection. As the energy limitation of the nodes in IoT, they are particularly vulnerable. It is much easier to hijack the nodes than to attack the data center for hackers. Thus, it is a crucial and urgent issue to realize the trusted update of authorization of nodes. When some nodes are hijacked, both of the behaviors to upload data to servers and to download information from servers should be forbidden. Otherwise, it might cause the serious damage to the sensitive data and privacy of servers. In order to solve this problem, we proposed a Proxy Re-encryption based Trusted Authorization scheme for nodes on CloudIoT(PRTA). PRTA is based on the proxy re-encryption (PRE), and the cloud server will play the roles of data storing and re-encrypting, which would reach the full potential of cloud computing and reduce the cost of nodes. The node's status is taken as one of the parameters for data re-encryption and it is under the authorization servers' control, which *Manuscript (including abstract) Click here to view linked References could ensure the security and reliability of the data and be beneficial for the privacy protection in CloudIoT. Also, the authorization servers are divided into the downloading and uploading kinds, which will make the application range much wider.

Privacy-Preserving Cloud Data Sharing for Healthcare Systems with Hybrid Blockchain

“…OTRE scheme has low computational cost for ReKeyGen and ReEnc algorithm than all mentioned schemes in table 3. OTRE Dec algorithm computational cost is higher than KRE scheme and almost as same as Su et al's [37]. So, the proposed OTRE scheme has higher overall computational cost than proposed KRE scheme due to providing receiver data privacy needed in between patient and research station but proposed OTRE scheme has lower overall computational cost than Xu et al's [32], Huang et al' [33], Sur et al's [34], Lu et al's [35] and Deng et al's [36] and almost same overall computational cost as Su et al's [37].…”

Efficient Proxy Re-encryption Scheme for E-Voting System

“…The true identity information of voters is hidden and the voter is able to vote anonymously. This cost is considerably lower than latest PRE schemes [37,40,41,42,43] and marginally higher than the some of classic PRE schemes for the better security and data integrity. For the communication cost of or original lengthen and transformed lengthen, our scheme does not bear paring communication cost in ciphertext and the slight high cost in the element in is to verify the data integrity.…”

“…In addition, to further analyze the advantage of our encryption schemes in the e-voting system, some applied in voting system encryption schemes [37][38][39] are also compared. Meantime, the latest proxy re-encryption schemes [40][41][42][43] are also compared to further justify that the results of our proposed research are better. From the compared result in level)" due to the demand for the voting system.…”

“…In our scheme, some hash operations are used in the protocol to protect the security of secret keys or verify the integrity of transformed data. In some schemes [36,37,40,41,42,43], the data integrity is verified by the bilinear pairing operations. It is worth mentioning that the computational costs of the hash operation in our scheme which could be calculated much faster than bilinear pairing in other schemes.…”

“…(3) The result of communication complexity comparison can be find in Table 4. Compared with PRE schemes [14,34,35,36,37,40,41,42,43], our scheme a trivial amount of overhead in communication cost. For the communication cost of re-encryption key, our scheme only cost one length of an element in and two length of an element in .…”