The data nodes with heterogeneous database in early warning system for grain security seriously hampered the effective data collection in this system. In this article,the existing middleware technologies was analyzed,...The data nodes with heterogeneous database in early warning system for grain security seriously hampered the effective data collection in this system. In this article,the existing middleware technologies was analyzed,the problem-solution approach of heterogeneous data sharing was discussed through middleware technologies. Based on this method,and according to the characteristics of early warning system for grain security,the technology of data sharing in this system were researched and explored to solve the issues of collection of heterogeneous data sharing.展开更多
With its untameable and traceable properties,blockchain technology has been widely used in the field of data sharing.How to preserve individual privacy while enabling efficient data queries is one of the primary issue...With its untameable and traceable properties,blockchain technology has been widely used in the field of data sharing.How to preserve individual privacy while enabling efficient data queries is one of the primary issues with secure data sharing.In this paper,we study verifiable keyword frequency(KF)queries with local differential privacy in blockchain.Both the numerical and the keyword attributes are present in data objects;the latter are sensitive and require privacy protection.However,prior studies in blockchain have the problem of trilemma in privacy protection and are unable to handle KF queries.We propose an efficient framework that protects data owners’privacy on keyword attributes while enabling quick and verifiable query processing for KF queries.The framework computes an estimate of a keyword’s frequency and is efficient in query time and verification object(VO)size.A utility-optimized local differential privacy technique is used for privacy protection.The data owner adds noise locally into data based on local differential privacy so that the attacker cannot infer the owner of the keywords while keeping the difference in the probability distribution of the KF within the privacy budget.We propose the VB-cm tree as the authenticated data structure(ADS).The VB-cm tree combines the Verkle tree and the Count-Min sketch(CM-sketch)to lower the VO size and query time.The VB-cm tree uses the vector commitment to verify the query results.The fixed-size CM-sketch,which summarizes the frequency of multiple keywords,is used to estimate the KF via hashing operations.We conduct an extensive evaluation of the proposed framework.The experimental results show that compared to theMerkle B+tree,the query time is reduced by 52.38%,and the VO size is reduced by more than one order of magnitude.展开更多
With the development of Internet technology,secure storage and secure sharing of data have become increasingly important.Traditional data sharing schemes exist a series of problems including lack of security and low e...With the development of Internet technology,secure storage and secure sharing of data have become increasingly important.Traditional data sharing schemes exist a series of problems including lack of security and low efficiency.In this paper,we construct a secure and efficient data sharing scheme based on threshold Paillier algorithm and blockchain technology,which achieves secure data storage and sharing without a third-party institution.Firstly,we propose a(t,l)threshold Paillier blockchain data sharing scheme,which effectively prevents decryption failures caused by the loss of a single node’s private key.Secondly,we propose a combined on-chain and off-chain data storage scheme,we store the ciphertext on the cloud server and the ciphertext hash value on the blockchain,which not only ensures the integrity of the data but also solves the storage limitation problem on the blockchain.Finally,we use the simulation paradigm to prove the security of the scheme in the semi-honest model.The discussion results of the comparison and the analysis of performance show that the blockchain data security sharing scheme proposed in this paper has lower computational overhead and higher security than other similar schemes.展开更多
基金Supported by Monitoring and Early warning System for Grain Security in Henan (0613024000)
文摘The data nodes with heterogeneous database in early warning system for grain security seriously hampered the effective data collection in this system. In this article,the existing middleware technologies was analyzed,the problem-solution approach of heterogeneous data sharing was discussed through middleware technologies. Based on this method,and according to the characteristics of early warning system for grain security,the technology of data sharing in this system were researched and explored to solve the issues of collection of heterogeneous data sharing.
文摘With its untameable and traceable properties,blockchain technology has been widely used in the field of data sharing.How to preserve individual privacy while enabling efficient data queries is one of the primary issues with secure data sharing.In this paper,we study verifiable keyword frequency(KF)queries with local differential privacy in blockchain.Both the numerical and the keyword attributes are present in data objects;the latter are sensitive and require privacy protection.However,prior studies in blockchain have the problem of trilemma in privacy protection and are unable to handle KF queries.We propose an efficient framework that protects data owners’privacy on keyword attributes while enabling quick and verifiable query processing for KF queries.The framework computes an estimate of a keyword’s frequency and is efficient in query time and verification object(VO)size.A utility-optimized local differential privacy technique is used for privacy protection.The data owner adds noise locally into data based on local differential privacy so that the attacker cannot infer the owner of the keywords while keeping the difference in the probability distribution of the KF within the privacy budget.We propose the VB-cm tree as the authenticated data structure(ADS).The VB-cm tree combines the Verkle tree and the Count-Min sketch(CM-sketch)to lower the VO size and query time.The VB-cm tree uses the vector commitment to verify the query results.The fixed-size CM-sketch,which summarizes the frequency of multiple keywords,is used to estimate the KF via hashing operations.We conduct an extensive evaluation of the proposed framework.The experimental results show that compared to theMerkle B+tree,the query time is reduced by 52.38%,and the VO size is reduced by more than one order of magnitude.
基金supported by the Defense Industrial Technology Development Program(JCKY2021208B036).
文摘With the development of Internet technology,secure storage and secure sharing of data have become increasingly important.Traditional data sharing schemes exist a series of problems including lack of security and low efficiency.In this paper,we construct a secure and efficient data sharing scheme based on threshold Paillier algorithm and blockchain technology,which achieves secure data storage and sharing without a third-party institution.Firstly,we propose a(t,l)threshold Paillier blockchain data sharing scheme,which effectively prevents decryption failures caused by the loss of a single node’s private key.Secondly,we propose a combined on-chain and off-chain data storage scheme,we store the ciphertext on the cloud server and the ciphertext hash value on the blockchain,which not only ensures the integrity of the data but also solves the storage limitation problem on the blockchain.Finally,we use the simulation paradigm to prove the security of the scheme in the semi-honest model.The discussion results of the comparison and the analysis of performance show that the blockchain data security sharing scheme proposed in this paper has lower computational overhead and higher security than other similar schemes.
