Abstract

Cloud-based Internet of Things, which is considered as a promising paradigm these days, can provide various applications for our society. However, as massive sensitive and private data in IoT devices are collected and outsourced to cloud for data storage, processing, or sharing for cost saving, the data security has become a bottleneck for its further development. Moreover, in many large-scale IoT systems, multiple group data sharing is practical for users. Thus, how to ensure data security in multiple group data sharing remains an open problem, especially the fine-grained access control and data integrity verification with public auditing. Therefore, in this paper, we propose a blockchain-based fine-grained data sharing scheme for multiple groups in cloud-based IoT systems. In particular, we design a novel multiauthority large universe CP-ABE scheme to guarantee the fine-grained access control and data integrity across multiple groups by integrating group signature into our scheme. Moreover, to ease the need for a trusted third auditor in traditional data public auditing schemes, we introduce blockchain technique to enable a distributed data public auditing. In addition, with the group signature, our scheme also realizes anonymity and traitor tracing. The security analysis and performance evaluation show that our scheme is practical for large-scale IoT systems.

Highlights

  • Access StructureDefinition 1 (access structures [3]). Suppose that 􏼈L1, . . . , Ln􏼉 is a parties set

  • Introduction eInternet of ings (IoT) brings the power of the Internet, data processing, and analytics to the real world of physical objects. e fast development of IoT has greatly facilitated a variety of applications all over the world, such as the Internet of Vehicles (IoV), Industrial Internet of ings (IIoT), and Health Internet of ings (HIoT) [1]

  • Erefore, many researchers have dedicated their research to data security in sharing scenarios. e works in [3,4,5,6] solve the data access control for data sharing in various scenarios and the proposals in [7,8,9,10] focus on the data integrity verification and public auditing

Read more

Summary

Access Structure

Definition 1 (access structures [3]). Suppose that 􏼈L1, . . . , Ln􏼉 is a parties set. A secret sharing scheme over the attribute set is called linear over Zp if it satisfies the following : 1. H, let the function φ define the vatxhte2tec,rt.iob.vru.e,ct→exvtontr h∈a(→tZvsl,,paxbas2er,le.iss.ut.hnt,heixfeonj)rthTmse,rclioyrnwectwhaohtshsiecφanht(jaTw)t.irilGsal nitbvdheeoenmtsrth;haatnehrseecpdnoo,lsMueamn→ovndf i(sMth→ev v)jecbteolroonfghs shares to the of the secret s based attribute φ(j). In a group signature scheme, any group member can sign a message anonymously on behalf of the entire group. No one can generate a valid group signature except the members of the group. No one, including the group manager, can generate a valid group signature in the name of other group members. E verifier has the root hash value HR and requests f2. He requires authentication of the received file. He requires authentication of the received file. e prover provides the verifier the auxiliary arHeucRt′eh ievneHtsi(cΩaHtiAoa nnHdBin)t.fhoFerinmnaacltloyiom, ntphueΩtvees riHHfieA(rf c1h,HeHc(kBHs).w(fhe1)teh Hevr(eHrfifiR2′)ei)rs, the same as HR

Blockchain
Cryptographic Background
System Model and Security Requirements
Blockchain-Based Fine-Grained Data Sharing for Multiple Groups
Data Auditing
User Tracing
Security Analysis
Performance Evaluation
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.