Partially-hiding functional encryption for degree-2 polynomials with fine-grained access control  

作　　者：Haifeng QIAN Cheng LIN Qiaohan CHU Jie CHEN 

机构地区：[1]Shanghai Key Laboratory of Trustworthy Computing,Software Engineering Institute,East China Normal University,Shanghai 200062,China

出　　处：《Frontiers of Computer Science》2024年第3期231-233,共3页中国计算机科学前沿（英文版）

基　　金：supported by the National Natural Science Foundation of China(61972156,62372180);the NSFC-ISF Joint Scientific Research Program(61961146004);the Innovation Program of Shanghai Municipal Education Commission(2021-01-07-00-08-E00101);the“Digital Silk Road”Shanghai International Joint Lab of Trustworthy Intelligent Software(22510750100).

摘　　要：1 Introduction Boneh et al.[1]first systematically introduce the concept of Functional Encryption(FE)which overcomes all-or-nothing limitation of traditional public key encryption.However,FE hides a potential problem:even if the secret key is obtained legitimately,once it is released,it can be used forever.This leads to that the secret key may leak information inherently.To deal with this problem and make FE more practical,Abdalla et al.[2]recently constructed inner-product FE(IPFE)with fine-grained access control achieving strong security guarantees under standard assumptions.

关 键 词：GRAIN ENCRYPTION ENCRYPTION 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] TP309[自动化与计算机技术—计算机科学与技术]