A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted Data

1985 ◽  
Author(s):  
G.R. Blakley ◽  
Catherine Meadows
Keyword(s):  
Encryption Scheme ◽  
Encrypted Data ◽  
Database Encryption

An Efficient Fully Homomorphic Encryption Scheme for Private Information Retrieval in the Cloud

2019 ◽  
Vol 34 (04) ◽  
pp. 2055008
Author(s):  
Xun Wang ◽  
Tao Luo ◽  
Jianfeng Li
Keyword(s):  
Information Retrieval ◽  
Theoretical Analysis ◽  
Private Information ◽  
Homomorphic Encryption ◽  
Private Information Retrieval ◽  
Encryption Scheme ◽  
Fully Homomorphic Encryption ◽  
Encrypted Data ◽  
Privacy Concerns ◽  
Simulation Results

Information retrieval in the cloud is common and convenient. Nevertheless, privacy concerns should not be ignored as the cloud is not fully trustable. Fully Homomorphic Encryption (FHE) allows arbitrary operations to be performed on encrypted data, where the decryption of the result of ciphertext operation equals that of the corresponding plaintext operation. Thus, FHE schemes can be utilized for private information retrieval (PIR) on encrypted data. In the FHE scheme proposed by Ducas and Micciancio (DM), only a single homomorphic NOT AND (NAND) operation is allowed between consecutive ciphertext refreshings. Aiming at this problem, an improved FHE scheme is proposed for efficient PIR where homomorphic additions and multiplications are based on linear operations on ciphertext vectors. Theoretical analysis shows that when compared with the DM scheme, the proposed scheme allows multiple homomorphic additions and a single homomorphic multiplication to be performed. The number of allowed homomorphic additions is determined by the ratio of the ciphertext modulus to the upper bound of initial ciphertext noise. Moreover, simulation results show that the proposed scheme is significantly faster than the DM scheme in the homomorphic evaluation for a series of algorithms.

scholarly journals Storage and Communication Security in Cloud Computing Using a Homomorphic Encryption Scheme Based Weil Pairing

2020 ◽  
Vol 26 (1) ◽  
pp. 78-83
Author(s):  
Demet Cidem Dogan ◽  
Huseyin Altindis
Keyword(s):  
Cloud Computing ◽  
Elliptic Curve ◽  
Data Transfer ◽  
Homomorphic Encryption ◽  
Discrete Logarithm ◽  
Original Data ◽  
Bilinear Pairing ◽  
Encryption Scheme ◽  
Weil Pairing ◽  
Encrypted Data

With introduction of smart things into our lives, cloud computing is used in many different areas and changes the communication method. However, cloud computing should guarantee the complete security assurance in terms of privacy protection, confidentiality, and integrity. In this paper, a Homomorphic Encryption Scheme based on Elliptic Curve Cryptography (HES-ECC) is proposed for secure data transfer and storage. The scheme stores the data in the cloud after encrypting them. While calculations, such as addition or multiplication, are applied to encrypted data on cloud, these calculations are transmitted to the original data without any decryption process. Thus, the cloud server has only ability of accessing the encrypted data for performing the required computations and for fulfilling requested actions by the user. Hence, storage and transmission security of data are ensured. The proposed public key HES-ECC is designed using modified Weil-pairing for encryption and additional homomorphic property. HES-ECC also uses bilinear pairing for multiplicative homomorphic property. Security of encryption scheme and its homomorphic aspects are based on the hardness of Elliptic Curve Discrete Logarithm Problem (ECDLP), Weil Diffie-Hellman Problem (WDHP), and Bilinear Diffie-Helman Problem (BDHP).

A Synthetic Encryption Scheme on Attribute Granularity in the ODB Model

2012 ◽  
Vol 151 ◽  
pp. 668-672
Author(s):  
Ning Wang ◽  
Hong Chao Zhuang ◽  
Shan Zhuang
Keyword(s):  
Data Encryption ◽  
Encryption Scheme ◽  
Exact Results ◽  
Encrypted Data ◽  
Hit Rate ◽  
Redundant Data ◽  
Outsourced Database

The improvement of cryptogram query hit rate and the reduction of redundant data in query results are the challenges in the outsourced database (ODB) model. A synthetic encryption scheme applied to the ODB is presented to solve the problem of precise query over the cryptogram. This scheme employs encryption scheme on the attribute granularity, which combines a newly k-Mapping Character-data Encryption Scheme (k-MCES) with the existing Order Preserving Encryption Scheme (OPES). The theories and experiments analysis show that queries over encrypted data with this synthetic encryption scheme can return exact results. Furthermore, this scheme is correct and safe.

scholarly journals A Secure Database Encryption Scheme

2004 ◽  
Vol 1 (4) ◽  
pp. 327-331 ◽  
Author(s):  
Zongkai Yang ◽  
Samba Sesay ◽  
Jingwen Chen ◽  
Du Xu
Keyword(s):  
Encryption Scheme ◽  
Database Encryption
Sign in / Sign up

Export Citation Format

Share Document