检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:彭志宇[1] 李善平[1] 杨朝晖[1] 林欣[1]
机构地区:[1]浙江大学计算机科学与技术学院,浙江杭州310027
出 处:《浙江大学学报(工学版)》2010年第5期897-902,共6页Journal of Zhejiang University:Engineering Science
基 金:国家自然科学基金资助项目(60473052;60773180);浙江省自然科学基金资助项目(Y106427)
摘 要:为了解决信任管理授权过程中的用户隐私泄露问题,提出匿名授权方法.针对经典的基于角色的信任管理语言中实名申请服务的缺陷,用动态查找出的代理角色集来代理用户申请服务,既保证了授权管理中证书链查找的正常进行,又实现了用户真实身份以可量化的方式对资源提供者匿名,证明了该方法的最坏时间复杂度与传统的正向证书链搜索保持一致.为了提高实际应用中的时间性能,提出在各个结点上缓存其成员的优化机制.实验表明,通过缓存优化,该匿名授权方法的时间性能在证书变化频率较低的稳定系统中得到了大幅提高.An anonymous authorization mechanism was proposed to protect the user's privacy in the process of authorization in trust management.User requested for services using their real identification in most of the classic trust-management language system,which potentially leaded to the privacy leaking. Through dynamically searching for the delegation roles which take over the request,the anonymous authorization mechanism retained the right behavior of credential chain discovery and achieved a quantitative way of anonymity against the resource provider.Results showed that the anonymous mechanism shared the same worst-case time complexity with the traditional forward credential-chain-searching method.A method of caching all the members in the nodes was proposed to improve the performance in time spending.Simulation results showed that the performance in time spending greatly improved in the relative stable systems,in which the credentials change slowly.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15