Multi-input Inner-Product Functional Encryption from Pairings

2017 ◽  
pp. 601-626 ◽  
Author(s):  
Michel Abdalla ◽  
Romain Gay ◽  
Mariana Raykova ◽  
Hoeteck Wee
Keyword(s):  
Inner Product ◽  
Functional Encryption

Tightly CCA-Secure Inner Product Functional Encryption Scheme

2021 ◽  
Author(s):  
Xiangyu Liu ◽  
Shengli Liu ◽  
Shuai Han ◽  
Dawu Gu
Keyword(s):  
Inner Product ◽  
Encryption Scheme ◽  
Functional Encryption

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

Privacy-Preserving Tax Calculations in Smart Cities by Means of Inner-Product Functional Encryption

2018 ◽  
Author(s):  
Oana Stan ◽  
Renaud Sirdey ◽  
Cedric Gouy-Pailler ◽  
Pierre Blanchart ◽  
Amira BenHamida ◽  
...  
Keyword(s):  
Smart Cities ◽  
Privacy Preserving ◽  
Inner Product ◽  
Functional Encryption
Sign in / Sign up

Export Citation Format

Share Document