1. Distributed Searchable Asymmetric Encryption
- Author
-
Lin Teng, Jie Liu, and Shoulin Yin
- Subjects
Key Wrap ,Control and Optimization ,Plaintext-aware encryption ,Computer Networks and Communications ,Computer science ,Encryption ,computer.software_genre ,Computer security ,Disk encryption hardware ,Public-key cryptography ,Watermarking attack ,Multiple encryption ,Email encryption ,Filesystem-level encryption ,Ciphertext ,Electrical and Electronic Engineering ,business.industry ,Client-side encryption ,Disk encryption theory ,Deterministic encryption ,Disk encryption ,Hardware and Architecture ,Probabilistic encryption ,Signal Processing ,56-bit encryption ,Key (cryptography) ,40-bit encryption ,Keyfile ,Attribute-based encryption ,Link encryption ,On-the-fly encryption ,business ,computer ,Information Systems - Abstract
Searchable asymmetric encryption (SAE) can also be called Public Key Encryption with Keyword Search (PEKS), which allows us to search the keyword on the data of having been encrypted. The essence of Asymmetric searchable encryption is that users exchange the data of encryption, one party sends a ciphertext with key encryption, the other party with another key receives the ciphertext. Encryption key is not the same as the decryption key, and cannot deduce another key from any one of the key, thus it greatly enhances the information protection, and can prevent leakage the user's search criteria—Search Pattern. Secure schemes of SAE are practical, sometimes, however the speed of encryption/decryption in Public-key encryption is slower than private key. In order to get higher efficiency and security in information retrieval, in this paper we introduce the concept of distributed SAE, which is useful for security and can enable search operations on encrypted data. Moreover, we give the proof of security.
- Published
- 2016