Blockchain Enabled Data Sharing Scheme for Consumer IoT Applications

Author(s):  
Bowen Hu ◽  
Yingwen Chen ◽  
Hujie Yu ◽  
Linghang Meng ◽  
Zhimin Duan
2021 ◽  
Vol 16 ◽  
pp. 2579-2580
Author(s):  
Caihui Lan ◽  
Caifen Wang ◽  
Haifeng Li ◽  
Liangliang Liu

2018 ◽  
Vol 8 (12) ◽  
pp. 2519
Author(s):  
Wei Li ◽  
Wei Ni ◽  
Dongxi Liu ◽  
Ren Liu ◽  
Shoushan Luo

With the rapid development of cloud computing, it is playing an increasingly important role in data sharing. Meanwhile, attribute-based encryption (ABE) has been an effective way to share data securely in cloud computing. In real circumstances, there is often a mutual access sub-policy in different providers’ access policies, and the significance of each attribute is usual diverse. In this paper, a secure and efficient data-sharing scheme in cloud computing, which is called unified ciphertext-policy weighted attribute-based encryption (UCP-WABE), is proposed. The weighted attribute authority assigns weights to attributes depending on their importance. The mutual information extractor extracts the mutual access sub-policy and generates the mutual information. Thus, UCP-WABE lowers the total encryption time cost of multiple providers. We prove that UCP-WABE is selectively secure on the basis of the security of ciphertext-policy weighted attribute-based encryption (CP-WABE). Additionally, the results of the implementation shows that UCP-WABE is efficient in terms of time.


Author(s):  
Jingwen Pan ◽  
Jie Cui ◽  
Lu Wei ◽  
Yan Xu ◽  
Hong Zhong

Sensors ◽  
2018 ◽  
Vol 19 (1) ◽  
pp. 114 ◽  
Author(s):  
Dong Chen ◽  
Wei Lu ◽  
Weiwei Xing ◽  
Na Wang

With the wide application of wireless sensor networks (WSNs), secure data sharing in networks is becoming a hot research topic and attracting more and more attention. A huge challenge is securely transmitting the data from the source node to the sink node. Except for eavesdropping the information stored in the packages, the adversary may also attempt to analyze the contextual information of the network to locate the source node. In this paper, we proposed a secure data sharing approach to defend against the adversary. Specifically, we first design a secret key mechanism to guarantee the security of package delivery between a pair of nodes. Then, a light-weighted secret sharing scheme is designed to map the original message to a set of shares. Finally, the shares are delivered to the sink node independently based on a proper random routing algorithm. Simulation results illustrate that our approach can defend against the eavesdropping and tracing-back attack in an energy-efficient manner.


Sign in / Sign up

Export Citation Format

Share Document