scholarly journals Hardware-Supported ORAM in Effect: Practical Oblivious Search and Update on Very Large Dataset

2019 ◽  
Vol 2019 (1) ◽  
pp. 172-191 ◽  
Author(s):  
Thang Hoang ◽  
Muslum Ozgur Ozmen ◽  
Yeongjin Jang ◽  
Attila A. Yavuz
Keyword(s):  
High Efficiency ◽  
Keyword Search ◽  
Essential Feature ◽  
Random Access ◽  
Communication Overhead ◽  
Large Dataset ◽  
Encrypted Data ◽  
Network Bandwidth ◽  
Secure Hardware ◽  
Access Patterns

Abstract The ability to query and update over encrypted data is an essential feature to enable breach-resilient cyber-infrastructures. Statistical attacks on searchable encryption (SE) have demonstrated the importance of sealing information leaks in access patterns. In response to such attacks, the community has proposed the Oblivious Random Access Machine (ORAM). However, due to the logarithmic communication overhead of ORAM, the composition of ORAM and SE is known to be costly in the conventional client-server model, which poses a critical barrier toward its practical adaptations. In this paper, we propose a novel hardware-supported privacy-enhancing platform called Practical Oblivious Search and Update Platform (POSUP), which enables oblivious keyword search and update operations on large datasets with high efficiency. We harness Intel SGX to realize efficient oblivious data structures for oblivious search/update purposes. We implemented POSUP and evaluated its performance on a Wikipedia dataset containing ≥229 keyword-file pairs. Our implementation is highly efficient, taking only 1 ms to access a 3 KB block with Circuit-ORAM. Our experiments have shown that POSUP offers up to 70× less end-to-end delay with 100× reduced network bandwidth consumption compared with the traditional ORAM-SE composition without secure hardware. POSUP is also at least 4.5× faster for up to 99.5% of keywords that can be searched compared with state-of-the-art Intel SGX-assisted search platforms.

scholarly journals A CIPHERTEXT-POLICY ATTRIBUTE-BASED SEARCHABLE ENCRYPTION SCHEME IN NON-INTERACTIVE MODEL

2019 ◽  
Vol 35 (3) ◽  
pp. 233-249
Author(s):  
Van Anh Trinh ◽  
Viet Cuong Trinh
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Communication Overhead ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Encrypted Data ◽  
Attribute Based Encryption ◽  
Encrypt Data ◽  
Cryptographic Primitive ◽  
Ciphertext Policy

We address the problem of searching on encrypted data with expressive searching predicate and multi-writer/multi-reader, a cryptographic primitive which has many concrete application scenarios such as cloud computing, email gateway application and so on. In this paper, we propose a public-key encryption with keyword search scheme relied on the ciphertext-policy attribute-based encryption scheme. In our system, we consider the model where a user can generate trapdoors by himself/herself, we thus can remove the Trusted Trapdoor Generator which can save the resource and communication overhead. We also investigate the problem of combination of a public key encryption used to encrypt data and a public-key encryption with keyword search used to encrypt keywords, which can save the storage of the whole system

OSM-DSSE: A Searchable Encryption Scheme with Hidden Search Patterns and Access Patterns

2021 ◽  
Author(s):  
Hong Liu ◽  
Xueqin Li ◽  
Erchuan Guo ◽  
Yunpeng Xiao ◽  
Tun Li
Keyword(s):  
Incidence Matrix ◽  
Differential Privacy ◽  
Security Analysis ◽  
Searchable Encryption ◽  
Search Pattern ◽  
Communication Overhead ◽  
Encrypted Data ◽  
Searchable Symmetric Encryption ◽  
Search Patterns ◽  
Access Patterns

Abstract Dynamic searchable encryption methods allow a client to perform searches and updates over encrypted data stored in the cloud. However, existing researches show that the general dynamic searchable symmetric encryption (DSSE) scheme is vulnerable to statistical attacks due to the leakage of search patterns and access patterns, which is detrimental to protecting the users’ privacy. Although the traditional Oblivious Random Access Machine (ORAM) can hide the access pattern, it also incurs significant communication overhead and cannot hide the search pattern. These limitations make it difficult to deploy the ORAM method in real cloud environments. To overcome this limitation, a DSSE scheme called obliviously shuffled incidence matrix DSSE (OSM-DSSE) is proposed in this paper to access the encrypted data obliviously. The OSM-DSSE scheme realizes efficient search and update operations based on an incidence matrix. In particular, a shuffling algorithm using Paillier encryption is combined with 1-out-of-n obliviously transfer (OT) protocol and local differential privacy to obfuscate the search targets. Besides, a formalized security analysis and performance analysis on the proposed scheme is provided, which indicates that the OSM-DSSE scheme achieves high security, efficient searches, and low storage overhead. Also, this scheme not only completely hides the search and access patterns but also provides adaptive security against malicious attacks by adversaries. Furthermore, experimental results show that the OSM-DSSE scheme obtains 3-4x better execution efficiency than the state-of-art solutions.

scholarly journals A CIPHERTEXT-POLICY ATTRIBUTE-BASED SEARCHABLE ENCRYPTION SCHEME IN NON-INTERACTIVE MODEL

2019 ◽  
Vol 35 (3) ◽  
pp. 233-249
Author(s):  
Van Anh Trinh ◽  
Viet Cuong Trinh
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Communication Overhead ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Encrypted Data ◽  
Attribute Based Encryption ◽  
Encrypt Data ◽  
Cryptographic Primitive ◽  
Ciphertext Policy

We address the problem of searching on encrypted data with expressive searching predicate and multi-writer/multi-reader, a cryptographic primitive which has many concrete application scenarios such as cloud computing, email gateway application and so on. In this paper, we propose a public-key encryption with keyword search scheme relied on the ciphertext-policy attribute-based encryption scheme. In our system, we consider the model where a user can generate trapdoors by himself/herself, we thus can remove the Trusted Trapdoor Generator which can save the resource and communication overhead. We also investigate the problem of combination of a public key encryption used to encrypt data and a public-key encryption with keyword search used to encrypt keywords, which can save the storage of the whole system

scholarly journals Discrete Sine Transform-Based Interpolation Filter for Video Compression

2017 ◽  
Author(s):  
MyungJun Kim ◽  
Yung-Lyul Lee
Keyword(s):  
Video Coding ◽  
Discrete Cosine Transform ◽  
Video Compression ◽  
High Efficiency ◽  
Random Access ◽  
High Efficiency Video Coding ◽  
Interpolation Filter ◽  
Interpolation Filters ◽  
Low Delay ◽  
Sine Transform

High Efficiency Video Coding (HEVC) uses an 8-point filter and a 7-point filter, which are based on the discrete cosine transform (DCT), for the 1/2-pixel and 1/4-pixel interpolations, respectively. In this paper, discrete sine transform (DST)-based interpolation filters (IF) are proposed. The first proposed DST-based IFs (DST-IFs) use 8-point and 7-point filters for the 1/2-pixel and 1/4-pixel interpolations, respectively. The final proposed DST-IFs use 12-point and 11-point filters for the 1/2-pixel and 1/4-pixel interpolations, respectively. These DST-IF methods are proposed to improve the motion-compensated prediction in HEVC. The 8-point and 7-point DST-IF methods showed average BD-rate reductions of 0.7% and 0.3% in the random access (RA) and low delay B (LDB) configurations, respectively. The 12-point and 11-point DST-IF methods showed average BD-rate reductions of 1.4% and 1.2% in the RA and LDB configurations for the Luma component, respectively.

Time-Controlled Hierarchical Multi-keyword Search over Encrypted Data in Cloud-Assisted IoT

2021 ◽  
pp. 1-1
Author(s):  
Tong Liu ◽  
Yinbin Miao ◽  
Kim-Kwang Raymond Choo ◽  
Hongwei Li ◽  
Ximeng Liu ◽  
...  
Keyword(s):  
Keyword Search ◽  
Encrypted Data

scholarly journals Efficient verifiable fuzzy keyword search over encrypted data in cloud computing

2013 ◽  
Vol 10 (2) ◽  
pp. 667-684 ◽  
Author(s):  
Jianfeng Wang ◽  
Hua Ma ◽  
Qiang Tang ◽  
Jin Li ◽  
Hui Zhu ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Efficiency Analysis ◽  
Sensitive Data ◽  
Encrypted Data ◽  
Proposed Model ◽  
Cloud Server ◽  
Encryption Schemes ◽  
User Data ◽  
Fuzzy Keyword Search

As cloud computing becomes prevalent, more and more sensitive data is being centralized into the cloud by users. To maintain the confidentiality of sensitive user data against untrusted servers, the data should be encrypted before they are uploaded. However, this raises a new challenge for performing search over the encrypted data efficiently. Although the existing searchable encryption schemes allow a user to search the encrypted data with confidentiality, these solutions cannot support the verifiability of searching result. We argue that a cloud server may be selfish in order to save its computation ability or bandwidth. For example, it may execute only a fraction of the search and returns part of the searching result. In this paper, we propose a new verifiable fuzzy keyword search scheme based on the symbol-tree which not only supports the fuzzy keyword search, but also enjoys the verifiability of the searching result. Through rigorous security and efficiency analysis, we show that our proposed scheme is secure under the proposed model, while correctly and efficiently realizing the verifiable fuzzy keyword search. The extensive experimental results demonstrate the efficiency of the proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document