Phrase Search over Encrypted Data with Symmetric Encryption Scheme

2012 ◽  
Author(s):  
Yinqi Tang ◽  
Dawu Gu ◽  
Ning Ding ◽  
Haining Lu
Keyword(s):  
Encryption Scheme ◽  
Symmetric Encryption ◽  
Encrypted Data

A Novel Iterated Function System-Based Model for Coloured Image Encryption

2021 ◽  
Vol 12 (2) ◽  
pp. 1-10
Author(s):  
Amine Rahmani
Keyword(s):  
Image Encryption ◽  
Iterated Function System ◽  
Mathematical Concept ◽  
Logistic Equation ◽  
Encryption Scheme ◽  
Symmetric Encryption ◽  
New Model ◽  
Proposed Model ◽  
Iterated Function ◽  
Chaotic Cryptography

Chaotic cryptography has been a well-studied domain over the last few years. Many works have been done, and the researchers are still getting benefit from this incredible mathematical concept. This paper proposes a new model for coloured image encryption using simple but efficient chaotic equations. The proposed model consists of a symmetric encryption scheme in which it uses the logistic equation to generate secrete keys then an affine recursive transformation to encrypt pixels' values. The experimentations show good results, and theoretic discussion proves the efficiency of the proposed model.

scholarly journals Walks on graphs as symmetric or asymmetric tools to encrypt data

2002 ◽  
Vol 20 (1) ◽  
pp. 34 ◽  
Author(s):  
V. A. Ustimenko ◽  
Y. M. Khmelevsky
Keyword(s):  
Real Life ◽  
Theoretical Method ◽  
General Idea ◽  
Simple Groups ◽  
Prototype Model ◽  
Encryption Scheme ◽  
Symmetric Encryption ◽  
Encrypt Data ◽  
Rank 2 ◽  
Groups Of Lie Type

New results on graph theoretical method of encryption will be presented. The general idea is to treat vertices of a graph as messages, and walks of a certain length as ecnryption tools. We will construct one-time pad algorithms with a certain resistance to attacks when the adversary knows plaintext and ciphertext. Special linguistic graphs of high girth whose vertices (messages) and walks (encoding tools) could be both naturally identified with vectors over the finite field, and with the so-called parallelotopic graphs, which turn out to be efficient tools for symmetric encryption. We will formulate criteria when parallelotopic graph (or the more general graph of tactical configuration) is a graph of absolutely optimal encryption scheme, producing asymptotic one-time pad algorithm. We will show how to convert one-time pads, which are related to geometries of rank 2 of simple groups of Lie type, to a real-life encryption scheme involving potentially infinite text and flexible passwords. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for the generation of asymmetric cryptographic functions and related open key algorithms. We will construct new families of such graphs via group theoretical and geometrical technique. The software for symmetric and asymmetric ecnryption (prototype model of the package) is ready for demonstration.

scholarly journals IDCrypt: A Multi-User Searchable Symmetric Encryption Scheme for Cloud Applications

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 2908-2921 ◽  
Author(s):  
Guofeng Wang ◽  
Chuanyi Liu ◽  
Yingfei Dong ◽  
Peiyi Han ◽  
Hezhong Pan ◽  
...  
Keyword(s):  
Encryption Scheme ◽  
Symmetric Encryption ◽  
Searchable Symmetric Encryption ◽  
Cloud Applications

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).

scholarly journals Privacy-Preserving Approximate k-Nearest-Neighbors Search that Hides Access, Query and Volume Patterns

2021 ◽  
Vol 2021 (4) ◽  
pp. 549-574
Author(s):  
Alexandra Boldyreva ◽  
Tianxin Tang
Keyword(s):  
Nearest Neighbors ◽  
Privacy Preserving ◽  
Locality Sensitive Hashing ◽  
Security Model ◽  
Symmetric Encryption ◽  
K Nearest Neighbors ◽  
Encrypted Data ◽  
Generic Construction ◽  
Knn Search ◽  
Security Guarantees

Abstract We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the client sends the encrypted data to an untrusted server and later can perform secure approximate kNN search and updates. We design a security model and propose a generic construction based on locality-sensitive hashing, symmetric encryption, and an oblivious map. The construction provides very strong security guarantees, not only hiding the information about the data, but also the access, query, and volume patterns. We implement, evaluate efficiency, and compare the performance of two concrete schemes based on an oblivious AVL tree and an oblivious BSkiplist.

Sign in / Sign up

Export Citation Format

Share Document