With the widespread development of intelligent systems, a considerable number of mobile devices are connected together, and continuously generate huge amounts of data. Although cloud storage provides perfect solution for effectively storing these massive data, how to ensure the integrity of the outsourced data becomes challenging. For this reason, the primitive of verifiable data streaming (VDS) protocol was introduced, and enables a data owner to continuously outsource streaming data to an untrusted cloud server, while capturing the integrity of the outsourced data. That is, when a data user retrieves some data item via its index from the server, he/she can publicly verify its integrity with the proof generated and returned by the server. Supporting data update is one of the major features of VDS, and allows the data owner to replace an old data item with a new one. Although many VDS protocols have been proposed to enhance the functionality and efficiency of the original VDS protocol, they all ignore the issue of preserving those updated data items. In fact, in various application scenarios of VDS, preserving and storing previously updated data items is actually necessary. For example, in the setting of DNA sequencing, there might be multiple versions of DNA fragments at the same location due to the genetic mutation. Obviously, for more precise treatment, all these DNA fragments need to be preserved. To this end, in this paper, we propose a VDS protocol that features of enabling the query of the update history of each data item. Specifically, we first put forward a new chameleon authentication tree with update history (UCAT), which consists of two CATs (the basic tree and the update history tree). In more detail, the basic tree is used to store the data item appended to the corresponding location for the first time, and the update history tree is utilized to preserve each updated version of the corresponding data item. Furthermore, based on UCAT, we propose a VDS protocol supporting update history queries, which allows a data user to retrieve any version of the data item. The theoretical analysis and performance evaluation indicate that our protocol outperforms previous ones in the field of functionality, and its computation/communication costs are acceptable. We also prove its security in the standard model.

The wide deployment of Internet of Things (IoT) devices enables the controller to continuously collect massive volume data in automation systems, and makes it possible to make intelligent decisions based on machine learning techniques. In fact, data-driven intelligent automation systems have been common in the industrial community. Nevertheless, how to effectively store the collected stream data and ensure their integrity is still challenging. To this end, the notion of verifiable data streaming (VDS) protocol, which enables a client to outsource the stream data to an untrusted server in a verifiable manner, was introduced. However, we argue that existing VDS protocols based on the chameleon authentication tree (CAT) are inefficient in the data update, since the whole CAT must be updated accordingly to avoid acute exposure of chameleon hashing. Thus, they are infeasible for intelligent automation systems that need to frequently update data. In this article, we first introduce a new primitive called double-trapdoor chameleon hash tree (DCHT) based on the double-trapdoor chameleon hash families, where each leaf of DCHT is calculated and fixed by using a double-trapdoor chameleon hash family, making the entire DCHT always unchanged. Furthermore, we propose a novel VDS protocol based on the DCHT. Due to the distinctive properties of the underlying DCHT, the proposed VDS protocol has a constant update cost and more efficient than previous VDS protocols based on CAT. Besides, we prove that the proposed VDS protocol is secure in the standard model.

The cloud-assisted intelligent systems have attracted extensive attention due to their powerful data analysis and computation capabilities. However, how to handle encrypted data remains a challenging problem in intelligent systems. A promising solution is searchable symmetric encryption (SSE), which enables a client to privately outsource their data to the cloud while preserving keyword search functionality. In practice, dynamic SSE is more practical and supports efficient data addition and deletion. Unfortunately, data update will leak some additional information which can be exploited to break data privacy. To address this issue, forward and backward secure SSE schemes are proposed to reduce the leakage of data update. That is, forward security guarantees that the newly updated documents cannot reveal the previously searched keywords, while backward security guarantees that the server cannot recover the deleted documents. However, the existing forward and backward secure SSE schemes mainly consider curious-but-honest server. How to verify the soundness and completeness of search results is still a challenge. In this paper, we propose a noninteractive verifiable dynamic SSE scheme with forward and backward security from two universal accumulators. Specifically, the server in our scheme only needs one roundtrip to return the nondeleted search results to the client, which saves the communication overhead dramatically. Besides, our scheme can achieve public verification that anyone can verify the search results but not only the client who has the private key. Finally, we give a formal security analysis and compare the proposed scheme with other related work, the results show that our scheme can achieve the desired security properties with practical efficiency.

The primitive of proofs of ownership (PoWs) enables a prover to efficiently convince a verifier that he/she indeed owns a certain message in a knowledge-proof manner. As a result, it can prevent an adversary who only has a short information of the message from accessing the whole one. We argue that the existing PoWs based on Merkle hash tree and specific encodings are not much efficient if the size of message is sufficiently huge. In this paper, we first propose a new PoW protocol based on the chameleon hash function without key exposure. Interestingly, it is equivalent to having the prover compute a new collision of chameleon hashing as the proof in our construction. Therefore, the proposed protocol is much efficient since the computation and storage overhead of proof is independent of the size of the message. Moreover, we utilize the proposed PoWs to design a deduplication scheme over ciphertext.