Explore chapters and articles related to this topic
Homomorphic Encryption
Published in Kevin E. Foltz, William R. Simpson, Enterprise Level Security 2, 2020
Kevin E. Foltz, William R. Simpson
These encryption methods are listed in approximate order of security protection (from highest to lowest). Security protection decreases as more information is revealed about the data. For example, assuming the cryptographic methods are known, random encryption reveals essentially no information about the plaintext. Deterministic encryption (DET) allows determination of whether two encrypted values have the same plaintext values without revealing what this plaintext is. Order-preserving encryption (OPE) leaks the relative size of the plaintext values without revealing the values themselves.
A secure and efficient data deduplication framework for the internet of things via edge computing and blockchain
Published in Connection Science, 2022
Zeng Wu, Hui Huang, Yuping Zhou, Chenhuang Wu
Data deduplication is an effective method for helping CSPs save storage space and reduce network bandwidth requirements (Shakarami et al., 2021). However, as users become more aware of privacy and confidentiality, data uploaded to the cloud is more often encrypted (Harnik et al., 2010; Paulo & Pereira, 2014; Wu et al., 2021), which creates challenges for data deduplication. In order to successfully deduplicate encrypted data, Douceur et al. (2002) proposed the convergent encryption approach. Convergent encryption is a type of deterministic encryption that ensures that the same file can only be encrypted into the same ciphertext, with the plaintext content only determining the ciphertext. However, convergent encryption is vulnerable to brute-force attacks. In order to improve the resistance to these, message-locked encryption (MLE) and the DupLESS system have been proposed (Bellare et al., 2013; Keelveedhi et al., 2013). The DupLESS system (2013) uses a separate key server to generate keys. The key is jointly determined by the data itself and a system key, so it can improve the resistance to brute-force attacks. Also, to fight brute-force attacks, G. Zhang et al. (2021) proposed a blockchain-based deduplication scheme. Based on the improvement offered by convergent encryption, the scheme replaces the third-party auditor with an intelligent contract and proposes a hierarchical-role hash tree for authorisation. This scheme can resist brute-force attacks and complicity attacks. Aparna et al. (2021) also used a blockchain to record the file tag and user operation process. A smart contract replaces the CSP in conducting data duplication-checking and data management. This scheme reduces the bandwidth consumption of the system; however, over-reliance on the efficiency and performance of smart contracts can easily cause system instability.
Big Data analytics for privacy through ND-homomorphic encryption
Published in Journal of Control and Decision, 2023
The planned HE employing non-predictive encoding remains a kind of encoding that allows for a wide range of calculations towards remain done on scrambled information. The encryption of numeric values is performed using HE and a non-deterministic encryption algorithm. Two huge prime integers are required for value encryption. The sum of leading numbers must be superior than the sum of contribution values. Let us consider
A Privacy-preserving Image Retrieval Method Based on Improved BoVW Model in Cloud Environment
Published in IETE Technical Review, 2018
Jiaying Gong, Yanyan Xu, Xiao Zhao
Recently, several methods have been proposed to solve the problem of PCBIR. Lu et al. [14] proposed three distance-preserving methods: bit plane randomization, random projection, and random unary encoding, which are applied on low-level features such as color histogram. Karthik et al. [15] proposed a transparent privacy-preserving hash method, which keeps the statistical rules of encrypted AC coefficients but ignores the spatial information distribution of the image. Xu et al. [16] proposed a secure retrieval method for JPEG images, which preserves the distribution of the AC coefficients and the statistical rule of color after the decoding of encrypted images. Ferreira et al. proposed a method in [17], where color information is encrypted by deterministic encryption techniques to support color-feature-based CBIR, and texture information is encrypted by probabilistic encryption algorithms for better security. Zhang et al. [18] use Pallier encryption algorithm to protect some lower level features such as color, texture, and shape, and achieve secure retrieval effects. Some local-feature-based PCBIR methods are also proposed. Hsu et al. [19] put forward a homomorphic encryption-based secure SIFT method which has good security at the cost of serious ciphertext extensions. Xia et al. [20] proposed to use SIFT features and transform earth mover’s distance (EMD) in a way that the cloud server can evaluate the similarity between images without learning sensitive information. Huang et al. [21] convert the high-dimensional VLAD descriptors to compact binary codes, and then adapt the asymmetric scalar-product-preserving encryption to design PCBIR to achieve the privacy requirements in the cloud environment. In contrast with global feature approaches, local-feature-based PCBIR methods achieve higher retrieval accuracy, but it requires quite complex methods to implement distance preserving, which is not suitable for large-scale image retrieval under cloud environment.