检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王依然 陈燕俐[1] 王慧婷 WANG Yiran;CHEN Yanli;WANG Huiting(School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)
机构地区:[1]南京邮电大学计算机学院,江苏南京210023
出 处:《南京邮电大学学报(自然科学版)》2023年第4期101-110,共10页Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基 金:国家自然科学基金(61572263,61272084)资助项目。
摘 要:属性基代理重加密结合了代理重加密和属性基加密技术,允许半可信的代理将特定访问策略下的密文转换为另一个访问策略下的密文,实现加密数据的细粒度安全共享和访问控制。针对传统的格上属性基代理重加密方案虽然能实现在云端密文的代理,但却无法实现密文的运算处理问题,提出一个格上的属性基同态单向多跳代理重加密方案。方案不仅安全性较高,保证了即使被授权人和代理人联手也无法获得授权人的私钥,还实现了对新鲜密文和重加密密文的全同态运算。最后在DLWE假设下证明了方案具有诚实重加密攻击不可区分性和安全性。Attribute⁃based proxy re⁃encryption combines the concept of proxy re⁃encryption and attribute⁃based encryption,and allows a semi⁃trusted proxy to convert a ciphertext under a specific access policy to a ciphertext under another access policy.This technique guarantees fine⁃grained secure sharing of encrypted data and access control.However,the traditional attribute⁃based proxy re⁃encryption scheme on the lattice can realize the proxy of the ciphertext in the cloud,while is inept at its operation.This paper proposes an attribute⁃based homomorphic one⁃way multi⁃hop proxy re⁃encryption scheme on the lattice.The scheme holds a high security that the private key of the delegator cannot be obtained even if the delegatee and the agent collude.It also realizes the fully homomorphic operation of fresh ciphertext and re⁃encrypted ciphertext.Finally,the scheme is proved to have indistinguishable security against honest re⁃encryption attacks under the DLWE assumption.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222