Adaptive Secure Non-zero Inner Product Encryption Scheme with Small-scale Public Parameters

Haiying GAO; Duo WEI

doi:10.11999/JEIT190510

Volume 42 Issue 11

Nov. 2020

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2020 > 42(11): 2698-2705

Haiying GAO, Duo WEI. Adaptive Secure Non-zero Inner Product Encryption Scheme with Small-scale Public Parameters[J]. Journal of Electronics & Information Technology, 2020, 42(11): 2698-2705. doi: 10.11999/JEIT190510

Citation:

Haiying GAO, Duo WEI. Adaptive Secure Non-zero Inner Product Encryption Scheme with Small-scale Public Parameters[J]. Journal of Electronics & Information Technology, 2020, 42(11): 2698-2705. doi: 10.11999/JEIT190510

Citation:

PDF( 680 KB)

Adaptive Secure Non-zero Inner Product Encryption Scheme with Small-scale Public Parameters

doi: 10.11999/JEIT190510

Haiying GAO,
Duo WEI^,

University of Information Engineering, Zhengzhou 450001, China

Funds: The National Natural Science Foundation of China (61702548, 61601515), The Fundamental and Frontier Technology Research of Henan Province (162300410192)

Received Date: 2019-07-08
Rev Recd Date: 2020-03-28

Available Online: 2020-09-02

Publish Date: 2020-11-16

Abstract

Abstract

Inner product encryption is a kind of function encryption which supports inner product form. The public parameter scale of the existing inner product encryption schemes are large. In order to solve this problem, based on prime-order bilinear entropy expansion lemma and Double Pairing Vector Space (DPVS), an inner product encryption scheme is proposed in this paper, which has fewer public parameters and adaptive security. In the private key generation algorithm of the scheme, the components of the user’s attribute with the main private key are combined to generate a vector that can be combined with the key components in the entropy expansion lemma, and in encryption algorithm of the scheme, each component of the inner product vector is combined with ciphertext component in the entropy expansion lemma. Finally, under the condition of prime order bilinear entropy extension lemma and $\textstyle{{\rm{MDDH}}_{k, k + 1}^n}$ difficult assumption, the adaptive secure of the scheme is proved. The proposed scheme has only 10 group elements as public parameters, which is the smallest compared with the existing inner product encryption schemes.
- Inner product encryption,
- Prime-order bilinear entropy expansion,
- ${\rm{MDDH}}_{k,k + 1}^n$ difficult assumption,
- Adaptive secure

FullText(HTML)

References(15)

References

BALTICO C E Z, CATALANO D, and FIORE D. Practical functional encryption for quadratic functions with applications to predicate encryption[C]. The 37th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 2017: 67–100.

BONEH D, SAHAI A, and WATERS B. Functional encryption: Definitions and challenges[C]. The 8th conference on Theory of Cryptography, Providence, USA, 2011: 253–273.

曹丹, 王小峰, 王飞, 等. SA-IBE: 一种安全可追责的基于身份加密方案[J]. 电子与信息学报, 2011, 33(12): 2922–2928.

CAO Dan, WANG Xiaofeng, WANG Fei, et al. SA-IBE: A secure and accountable identity-based encryption scheme[J]. Journal of Electronics &Information Technology, 2011, 33(12): 2922–2928.

BONEH D and WATERS B. Conjunctive, subset, and range queries on encrypted data[C]. The 4th conference on Theory of Cryptography. Amsterdam, Netherlands, 2007: 535–554.

KATZ J, SAHAI A, and WATERS B. Predicate encryption supporting disjunctions, polynomial equations, and inner products[C]. The 27th Annual International Conference on Advances in Cryptology, Istanbul, Turkey: 2008: 146–162.

DATTA P, OKAMOTO T, and TAKASHIMA K. Adaptively simulation-secure attribute-hiding predicate encryption[C]. The 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, Australia, 2018: 640–672.

LEWKO A, OKAMOTO T, and SAHAI A. Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption[C]. The 29th Annual International Conference on Theory and Applications of Cryptographic Techniques, French Riviera, 2010: 62–91.

OKAMOTO T and TAKASHIMA K. Fully secure functional encryption with general relations from the decisional linear assumption[C]. The 30th Annual Conference on Advances in Cryptology, Santa Barbara, USA, 2010: 191–208.

OKAMOTO T and TAKASHIMA K. Fully secure unbounded inner-product and attribute-based encryption[C]. The 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, 2012: 349–366.

TOMIDA J and TAKASHIMA K. Unbounded inner product functional encryption from bilinear maps[C]. The 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, Australia, 2018: 609–639.

WATERS B. Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions[C]. The 29th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 2009: 619–636.

CHEN Jie, GAY R, and WEE H. Improved dual system ABE in prime-order groups via predicate encodings[C]. The 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, 2015: 595–624.

CHEN Jie, GONG Junqing, KOWALCZYK L, et al. Unbounded ABE via bilinear entropy expansion, revisited[C]. The 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, 2018: 503–534.

WEE H. Dual system encryption via predicate encodings[C]. The 11th Theory of Cryptography Conference, San Diego, USA, 2014: 616–637.

LEWKO A B and WATERS B. New techniques for dual system encryption and fully secure HIBE with short ciphertexts[C]. The 7th International Conference on Theory of Cryptography, Zurich, Switzerland, 2010: 455–479.

Relative Articles

Supplements(0)

Cited By

Proportional views