CROSS: Supervised Sharing of Private Data over Blockchains

Yin, Mingxin; Gao, Jiqiang; Guo, Xiaojie; Sun, Mengyao; Liu, Zheli; Zhang, Jianzhong; Wang, Jing

doi:10.1007/978-3-030-21373-2_7

Cited by 3 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Key generation: Before performing key generation process, AA needs to query RBC whether DR/DO is already registered. With reference to Yin et al's scheme, 20 DBSDS builds a user key tracing mechanism based on hierarchical tree structure, which ensures that DR has right to verify illegal data content directly, and different key generation strategies for different roles can fall into the following two categories: a. DR's key generation strategy: Whenever a highly credible node DR joins, it requests AA to distribute the corresponding key. AA will calculate the key value of the new DR according to the strategy…”

Section: Initialization and User Registrationmentioning

confidence: 99%

“…In order to evaluate the performance of the proposed DBSDS synthetically, we objectively analyze our scheme and compare it with the related data sharing schemes 18,20,25 from two aspects: functions and complexity of schemes.…”

Section: Complexity Analysis and Scheme Comparisonmentioning

confidence: 99%

“…User revocation. Some schemes 18,25 do not support user revocation during the supervision process, while CROSS 20 and our DBSDS can realize this function well. After a user is revoked, CROSS 20 will changes revocation status value in the user's private key to make the key invalid, while in our DBSDS, we record the change of the user's status on the RBC so that the user's identity cannot be verified during the next sharing process.…”

Section: Complexity Analysis and Scheme Comparisonmentioning

confidence: 99%

“…Among the referenced schemes, 18,20,25 only Wang et al's scheme 18 gives the complexity analysis, which mainly includes three stages of data storage, data sharing, and tracing. It is worth noting that communication complexity of their scheme is represented by the number of communication rounds.…”

Section: Complexity Analysis and Scheme Comparisonmentioning

confidence: 99%

“…• DBSDS designs a hierarchical key tracing tree 20 based on supervision relation and different key generation strategies, to give regulators the ability to supervise users and private data. According to the key tracing tree, regulators can calculate the private keys of supervised users, whereas no user can calculate the keys of the regulator and other users.…”

mentioning

confidence: 99%

See 4 more Smart Citations

DBSDS: A dual‐blockchain security data sharing model with supervision and privacy‐protection

Zhang

Luo

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

With the rapid development of big data technology and applications, sharing and supervision of massive data have become the demand of industry development. As an emerging technology, blockchain, with excellent characteristics, can promote the prosperity and development of the data‐sharing industry. However, the existing blockchain may lead to some privacy and security issues due to its transparency and lack of supervision. Hence, a secure data sharing model with supervision and privacy protection, named DBSDS, was proposed, which supports illegal content supervision and users revocation, and possesses flexible and fine‐grained access control on data sharing. Firstly, it introduces a dual‐blockchain architecture, one blockchain is used to ensure the integrity and traceability of private data and another is utilized to supervise illegal users so that they can no longer upload and share private data. Secondly, a key tracing tree was built and correspondingly different key generation strategies for different users were designed, which endows regulators with supervision capabilities. Finally, combined ABPER‐KS algorithm, both privacy protection and fine‐grained access control on private data can be accomplished. Furthermore, security analysis and performance comparison manifest that DBSDS is safe and owns better performance, and scheme implementation and experimental analysis indicate the practicality of DBSDS.

show abstract

Section: Initialization and User Registrationmentioning

confidence: 99%

Section: Complexity Analysis and Scheme Comparisonmentioning

confidence: 99%