With the development of various applications of blockchain, blockchain-assisted searchable encryption technology has received wide attention as it can eliminate misbehaviours of malicious servers through the verification and incentive mechanism of blockchain. However, most existing solutions update the encrypted data by means of appending new transactions, which does not scale and wastes resources. In this paper, we explore the potential of redactable blockchain and propose a privacy-preserving dynamic searchable encryption framework (DSE-RB), which is a general scheme that guarantees reliable queries and updates on encrypted data. In particular, we first use transaction-level editing technology to achieve a more flexible update operation of encrypted data without additional transactions while avoiding the waste of storage on the chain. To better support practical applications, we use an index partition method to divide the traditional binary tree index into a plurality of sub-indexes and introduce the concept of polynomials to simplify the whole access control mechanism. We define the security model and conduct repeated experiments on real data sets to test the efficiency. Experimental results and theoretical analysis show the practicability and security of our scheme.
5 September 2023 in IEEE Transactions on Cloud Computing
The server-aided encryption is widely used in encrypted deduplication systems to protect against brute-force attacks. However, it is non-trivial to update the master key managed by the key server in existing schemes. Once the master key is leaked, all user data are vulnerable to offline brute-force attacks. In this paper, we extend the server-aided encryption with the updatable encryption (UE) and a dynamic proof of ownership (PoW) protocol to make it support efficient key updates and can be used in the client-side deduplication. Specifically, we design an updatable server-aided encryption scheme based on UE, which achieves efficient encryption and the user-transparent key update for a system-level master key. Besides, to further enable our updatable server-aided encryption to be applicable to the client-side deduplication, we propose a dynamic PoW protocol based on the Merkle tree. Compared to the state-of-the-art PoW scheme, our PoW protects data privacy and allows multi-time leakages for the target file. Finally, we analyze the security of our scheme and present the performance evaluation. The results show that our scheme provides comprehensive security protection for user data and achieves efficient encryption, PoW, and key update.
30 November 2021 in IEEE Transactions on Cloud Computing
Dynamic searchable encryption, which allows clients to outsource their encrypted data to cloud servers and retain the ability to query and update data, has received wide attention. In the setting, it is essential to ensure that a server infers as little as possible about the content of the outsourced data and the queries it processes. In this paper, we propose a forward and backward secure searchable encryption scheme on bipartite graphs (FBSSE-BG) that offers the strongest level of backward security. In particular, we introduce the notion of update counter to construct a new bi-directional index structure, which realizes conjunctive queries over bipartite graphs and supports flexible updates of outsourced data. Besides, to minimize the information revealed to servers, we propose a new oblivious data structure to store the bi-directional index and use a semantically-secure encryption scheme to encrypt node information, such that servers can only observe a series of ORAM locations and encrypted paths. Finally, we prove the security of FBSSE-BG by using the real-world versus ideal-world formalization and provide experimental efficiency evaluations for its implementations.
The present study aimed to study the preparation and quality evaluation of potato steamed bread by using potato flour, wheat flour, and gluten at the presence of yeast and inorganic additives. As the rheological properties of the potato–wheat formulated flour negatively related to the potato flour, the potato–wheat formulated flour with 35% potato flour was set as the basic flour (100%). The effects of wheat gluten on the rheological properties of the dough were also evaluated, and gluten addition amount was set at 6.5%. The effects of yeast, sodium bicarbonate, citric acid, and monocalcium phosphate addition on steamed bread properties have been studied and optimized by orthogonal test. The obtained potato steamed bread formula was 100% basic flour (potato/wheat mass ratio of 35:65), 6.5% wheat gluten, 1.1% yeast, 1.4% NaHCO3, 0.75% citric acid, and 0.50% Ca(H2PO4)2. The prepared potato steamed bread has good sensory and texture properties, with natural potato flavor.
As a pivotal link between visual and linguistic relationships, image-text cross-modal retrieval has received widespread attention. However, existing studies primarily focus on intricate machine learning models to enhance retrieval accuracy and overlook the critical aspect of privacy preservation for images and texts, rendering them unsuitable for lightweight IoT environments. To tackle these challenges, we propose LPCR-IoT, a lightweight and privacy-preserving cross-modal retrieval scheme tailored to IoT environments. LPCR-IoT employs knowledge distillation to train lightweight student models for extracting feature vectors from images and texts, subsequently embedding them into a unified semantic space. Significantly, we propose a new training metric (i.e., Intra-modal Consistent Contrast Loss), which improves the retrieval accuracy by increasing the semantic consistency of the image and text in the common embedding space. Additionally, a novel quadtree index structure leveraging hybrid representation vectors is designed to effectively mitigate retrieval overhead, where feature vectors of images and texts alongside representation vectors are encrypted using a secure kNN algorithm based on LWE, enabling image-text matching in a large-scale ciphertext environment. Finally, we provide a detailed formal analysis to evaluate the security of LPCR-IoT and validate its practicality through extensive experiments on three real-world datasets, namely COCO, Flickr30k and NUS-WIDE.