scholarly journals An Approach Enabling Various Queries on Encrypted Industrial Data Stream

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Tao Wang ◽  
Bo Yang ◽  
Guoyong Qiu ◽  
Lina Zhang ◽  
Yong Yu ◽  
...  
Keyword(s):  
Data Stream ◽  
Inner Product ◽  
Adaptive Security ◽  
Encryption Scheme ◽  
Secret Key ◽  
Product Evaluations ◽  
Functional Encryption ◽  
Industrial Data ◽  
Encrypted Data ◽  
Industrial Internet

Massive data are generated and collected by devices in the industrial Internet of Things. Data sources would encrypt the data and send them to the data center through the gateway. For some supervision purpose, the gateway needs to observe the encrypted data stream and label the suspicious data. Instead of decrypting ciphertext at the gateway, which is not efficient, this paper presents a Φ-searchable functional encryption scheme that supports inner product evaluations on encrypted data. Based on this scheme, an approach enabling various queries on the encrypted industrial data stream is proposed. The adaptive security of our proposed underlying functional encryption scheme can be proven under general subgroup decision assumptions, and our scheme has the smaller public key, the smaller secret key, and the smaller ciphertext size compared to the related schemes. In addition, the experimental results show that our proposed scheme is efficient. Especially for the gateway, querying on the encrypted data only needs less than 20ms, which is practical for industrial data stream auditing scenario.

scholarly journals Efficient functional encryption for inner product with simulation-based security

Cybersecurity ◽  
2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Wenbo Liu ◽  
Qiong Huang ◽  
Xinjian Chen ◽  
Hongbo Li
Keyword(s):  
Inner Product ◽  
Encryption Scheme ◽  
Secret Key ◽  
Functional Encryption ◽  
Private Key ◽  
Simulation Based ◽  
Encryption And Decryption ◽  
The Standard Model ◽  
Secret Keys ◽  
Decisional Linear Assumption

AbstractFunctional encryption (FE) is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information. In FE, a user can learn specific function of encrypted messages by restricted functional key and reveal nothing else about the messages. Inner product encryption (IPE) is a special type of functional encryption where the decryption algorithm, given a ciphertext related to a vector x and a secret key related to a vector y, computes the inner product x·y. In this paper, we construct an efficient private-key functional encryption (FE) for inner product with simulation-based security, which is much stronger than indistinguishability-based security, under the External Decisional Linear assumption in the standard model. Compared with the existing schemes, our construction is faster in encryption and decryption, and the master secret key, secret keys and ciphertexts are shorter.

scholarly journals Improved Construction for Inner Product Functional Encryption

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Qingsong Zhao ◽  
Qingkai Zeng ◽  
Ximeng Liu
Keyword(s):  
Data Privacy ◽  
Bilinear Pairing ◽  
Inner Product ◽  
Secret Key ◽  
Functional Encryption ◽  
New Paradigm ◽  
Practical Applications ◽  
Simulation Based ◽  
The Standard Model ◽  
Standard Notion

Functional encryption (FE) is a vast new paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted data. In a FE scheme, a user can learn specific function of encrypted messages by restricted functional key and reveals nothing else about the messages. Besides the standard notion of data privacy in FE, it should protect the privacy of the function itself which is also crucial for practical applications. In this paper, we construct a secret key FE scheme for the inner product functionality using asymmetric bilinear pairing groups of prime order. Compared with the existing similar schemes, our construction reduces both necessary storage and computational complexity by a factor of 2 or more. It achieves simulation-based security, security strength which is higher than that of indistinguishability-based security, against adversaries who get hold of an unbounded number of ciphertext queries and adaptive secret key queries under the External Decisional Linear (XDLIN) assumption in the standard model. In addition, we implement the secret key inner product scheme and compare the performance with the similar schemes.

scholarly journals Practical CCA-Secure Functional Encryptions for Deterministic Functions

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Huige Wang ◽  
Kefei Chen ◽  
Tianyu Pan ◽  
Yunlei Zhao
Keyword(s):  
Affirmative Answer ◽  
Inner Product ◽  
Secret Key ◽  
Functional Encryption ◽  
Fine Grained ◽  
Indistinguishability Obfuscation ◽  
Simulation Based ◽  
Multilinear Maps ◽  
Hard Problems ◽  
Generic Transformation

Functional encryption (FE) can implement fine-grained control to encrypted plaintext via permitting users to compute only some specified functions on the encrypted plaintext using private keys with respect to those functions. Recently, many FEs were put forward; nonetheless, most of them cannot resist chosen-ciphertext attacks (CCAs), especially for those in the secret-key settings. This changed with the work, i.e., a generic transformation of public-key functional encryption (PK-FE) from chosen-plaintext (CPA) to chosen-ciphertext (CCA), where the underlying schemes are required to have some special properties such as restricted delegation or verifiability features. However, examples for such underlying schemes with these features have not been found so far. Later, a CCA-secure functional encryption from projective hash functions was proposed, but their scheme only applies to inner product functions. To construct such a scheme, some nontrivial techniques will be needed. Our key contribution in this work is to propose CCA-secure functional encryptions in the PKE and SK environment, respectively. In the existing generic transformation from (adaptively) simulation-based CPA- (SIM-CPA-) secure ones for deterministic functions to (adaptively) simulation-based CCA- (SIM-CCA-) secure ones for randomized functions, whether the schemes were directly applied to CCA settings for deterministic functions is not implied. We give an affirmative answer and derive a SIM-CCA-secure scheme for deterministic functions by making some modifications on it. Again, based on this derived scheme, we also propose an (adaptively) indistinguishable CCA- (IND-CCA-) secure SK-FE for deterministic functions. The final results show that our scheme can be instantiated under both nonstandard assumptions (e.g., hard problems on multilinear maps and indistinguishability obfuscation (IO)) and under standard assumptions (e.g., DDH, RSA, LWE, and LPN).

An efficient public key functional encryption for inner product evaluations

2019 ◽  
Vol 32 (17) ◽  
pp. 13117-13128
Author(s):  
Intae Kim ◽  
Jong Hwan Park ◽  
Seong Oun Hwang
Keyword(s):  
Public Key ◽  
Inner Product ◽  
Product Evaluations ◽  
Functional Encryption

scholarly journals Self-Processing Private Sensor Data via Garbled Encryption

2020 ◽  
Vol 2020 (4) ◽  
pp. 434-460
Author(s):  
Nathan Manohar ◽  
Abhishek Jain ◽  
Amit Sahai
Keyword(s):  
Data System ◽  
Sensor Data ◽  
Encryption Scheme ◽  
Secret Key ◽  
Functional Encryption ◽  
Private Data ◽  
Setup Phase

AbstractWe introduce garbled encryption, a relaxation of secret-key multi-input functional encryption (MiFE) where a function key can be used to jointly compute upon only a particular subset of all possible tuples of ciphertexts. We construct garbled encryption for general functionalities based on one-way functions.We show that garbled encryption can be used to build a self-processing private sensor data system where after a one-time trusted setup phase, sensors deployed in the field can periodically broadcast encrypted readings of private data that can be computed upon by anyone holding function keys to learn processed output, without any interaction. Such a system can be used to periodically check, e.g., whether a cluster of servers are in an “alarm” state.We implement our garbled encryption scheme and find that it performs quite well, with function evaluations in the microseconds. The performance of our scheme was tested on a standard commodity laptop.

scholarly journals Efficient Public Key Encryption with Disjunctive Keywords Search Using the New Keywords Conversion Method

Information ◽  
2018 ◽  
Vol 9 (11) ◽  
pp. 272 ◽  
Author(s):  
Yu Zhang ◽  
Yin Li ◽  
Yifan Wang
Keyword(s):  
Cloud Storage ◽  
Keyword Search ◽  
Public Key ◽  
Inner Product ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Encrypted Data ◽  
Bilinear Groups ◽  
Time And Space Complexity ◽  
Selection Of

Public key encryption with disjunctive keyword search (PEDK) is a public key encryption scheme that allows disjunctive keyword search over encrypted data without decryption. This kind of scheme is crucial to cloud storage and has received a lot of attention in recent years. However, the efficiency of the previous scheme is limited due to the selection of a less efficient converting method which is used to change query and index keywords into a vector space model. To address this issue, we design a novel converting approach with better performance, and give two adaptively secure PEDK schemes based on this method. The first one is built on an efficient inner product encryption scheme with less searching time, and the second one is constructed over composite order bilinear groups with higher efficiency on index and trapdoor construction. The theoretical analysis and experiment results verify that our schemes are more efficient in time and space complexity as well as more suitable for the mobile cloud setting compared with the state-of-art schemes.

scholarly journals Inner product encryption from ring learning with errors

Cybersecurity ◽  
2020 ◽  
Vol 3 (1) ◽  
Author(s):  
Shisen Fang ◽  
Shaojun Yang ◽  
Yuexin Zhang
Keyword(s):  
Inner Product ◽  
Encryption Scheme ◽  
Functional Encryption ◽  
Fine Grained ◽  
Learning With Errors

Abstract The functional encryption scheme designed using the lattice can realize fine-grained encryption and it can resist quantum attacks. Unfortunately, the sizes of the keys and ciphertexts in cryptographic applications based on learning with errors are large, which makes the algorithm inefficient. Therefore, we construct a functional encryption for inner product predicates scheme by improving the learning with errors scheme of Agrawal et al. [Asiacrypt 2011], and its security relies on the difficulty assumption of ring learning with errors. Our construction can reduce the sizes of the keys and ciphertexts compared with the learning with errors scheme.

Sign in / Sign up

Export Citation Format

Share Document