检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高海英[1] 魏铎 GAO Haiying;WEI Duo(University of Information Engineering,Zhengzhou 450001,China)
机构地区:[1]信息工程大学,郑州450001
出 处:《电子与信息学报》2020年第11期2698-2705,共8页Journal of Electronics & Information Technology
基 金:国家自然科学基金(61702548,61601515);河南省基础与前沿技术课题(162300410192)。
摘 要:内积加密是一种支持内积形式的函数加密,已有内积加密方案的公开参数规模较大,为解决该问题,该文基于素数阶熵扩张引理,利用双对偶向量空间(DPVS)技术,提出一个公开参数规模较小的具有适应安全性的内积加密方案。在方案的私钥生成算法中,将用户的属性向量的分量与主私钥向量结合,生成一个可与熵扩张引理中密钥分量结合的向量;在方案的加密算法中,将内积向量的每一分量与熵扩张引理中的部分密文分量结合。在素数阶熵扩张引理和MDDHk,k+1^n困难假设成立条件下,证明了方案具有适应安全性。该文方案公开参数仅有10个群元素,与现有内积加密方案相比,公开参数规模最小。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 andMDDHk,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.
关 键 词:内积加密 素数阶熵扩张引理 MDDHk k+1^n困难假设 适应安全
分 类 号:TN918.1[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.67.226