New Order-Revealing Encryption with Shorter Ciphertexts
As data outsourcing services have been becoming common recently, developing skills to search over encrypted data has received a lot of attention. Order-revealing encryption (OREnc) enables performing a range of queries on encrypted data through a publicly computable function that outputs the orderin...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-09-01
|
| Series: | Information |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2078-2489/11/10/457 |
| _version_ | 1827705546030972928 |
|---|---|
| author | Kee Sung Kim |
| author_facet | Kee Sung Kim |
| author_sort | Kee Sung Kim |
| collection | DOAJ |
| description | As data outsourcing services have been becoming common recently, developing skills to search over encrypted data has received a lot of attention. Order-revealing encryption (OREnc) enables performing a range of queries on encrypted data through a publicly computable function that outputs the ordering information of the underlying plaintexts. In 2016, Lewi et al. proposed an OREnc scheme that is more secure than the existing practical (stateless and non-interactive) schemes by constructing an ideally-secure OREnc scheme for small domains and a “domain-extension” scheme for obtaining the final OREnc scheme for large domains. They encoded a large message into small message blocks of equal size to apply them to their small-domain scheme, thus their resulting OREnc scheme reveals the index of the first differing message block. In this work, we introduce a new ideally-secure OREnc scheme for small domains with shorter ciphertexts. We also present an alternative message-block encoding technique. Combining the proposed constructions with the domain-extension scheme of Lewi et al., we can obtain a new large-domain OREnc scheme with shorter ciphertexts or with different leakage information, but longer ciphertexts. |
| first_indexed | 2024-03-10T16:05:29Z |
| format | Article |
| id | doaj.art-4312384308544f66bba6fe132929e8ed |
| institution | Directory Open Access Journal |
| issn | 2078-2489 |
| language | English |
| last_indexed | 2024-03-10T16:05:29Z |
| publishDate | 2020-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Information |
| spelling | doaj.art-4312384308544f66bba6fe132929e8ed2023-11-20T14:52:09ZengMDPI AGInformation2078-24892020-09-01111045710.3390/info11100457New Order-Revealing Encryption with Shorter CiphertextsKee Sung Kim0School of Computer Software, Daegu Catholic University, Gyeongbuk 38430, KoreaAs data outsourcing services have been becoming common recently, developing skills to search over encrypted data has received a lot of attention. Order-revealing encryption (OREnc) enables performing a range of queries on encrypted data through a publicly computable function that outputs the ordering information of the underlying plaintexts. In 2016, Lewi et al. proposed an OREnc scheme that is more secure than the existing practical (stateless and non-interactive) schemes by constructing an ideally-secure OREnc scheme for small domains and a “domain-extension” scheme for obtaining the final OREnc scheme for large domains. They encoded a large message into small message blocks of equal size to apply them to their small-domain scheme, thus their resulting OREnc scheme reveals the index of the first differing message block. In this work, we introduce a new ideally-secure OREnc scheme for small domains with shorter ciphertexts. We also present an alternative message-block encoding technique. Combining the proposed constructions with the domain-extension scheme of Lewi et al., we can obtain a new large-domain OREnc scheme with shorter ciphertexts or with different leakage information, but longer ciphertexts.https://www.mdpi.com/2078-2489/11/10/457order-preserving encryptionorder-revealing encryptiondatabase encryption |
| spellingShingle | Kee Sung Kim New Order-Revealing Encryption with Shorter Ciphertexts Information order-preserving encryption order-revealing encryption database encryption |
| title | New Order-Revealing Encryption with Shorter Ciphertexts |
| title_full | New Order-Revealing Encryption with Shorter Ciphertexts |
| title_fullStr | New Order-Revealing Encryption with Shorter Ciphertexts |
| title_full_unstemmed | New Order-Revealing Encryption with Shorter Ciphertexts |
| title_short | New Order-Revealing Encryption with Shorter Ciphertexts |
| title_sort | new order revealing encryption with shorter ciphertexts |
| topic | order-preserving encryption order-revealing encryption database encryption |
| url | https://www.mdpi.com/2078-2489/11/10/457 |
| work_keys_str_mv | AT keesungkim neworderrevealingencryptionwithshorterciphertexts |