专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2007079291A2 GENERATION OF SET COVERINGS WITH FREE RIDERS, AND GENERATION OF ORDERED SETS OF MEETING POINTS, IN SYSTEMS WHICH INCLUDE, BUT ARE NOT LIMITED TO, SYSTEMS FOR BROADCAST ENCRYPTION AND SYSTEMS FOR CERTIFICATE REVOCATION 审中-公开
标题翻译：产生无盖骑手的套装，以及订单会议点的生成，包括但不限于广播加密和系统进行证书转让的系统
公开(公告)号：WO2007079291A2
公开(公告)日：2007-07-12
申请号：PCT/US2006061166
申请日：2006-11-21
申请人： NTT DOCOMO INC , GENTRY CRAIG B , RAMZAN ZULFIKAR AMIN , WOODRUFF DAVID P
发明人： GENTRY CRAIG B , RAMZAN ZULFIKAR AMIN , WOODRUFF DAVID P
IPC分类号： H04L9/00
CPC分类号： H04L9/0822 , H04L9/3265 , H04L9/3268 , H04L2209/601
摘要： In a broadcast encryption scheme, an optimal or near-optimal set covering CV( f,P) is computed for a set P of privileged users and at most a predefined number f of revoked users ("free riders"). The covering consists of elements of a predefined set cover CC(U) for the set of all users U. The covering is computed by finding optimal or near-optimal coverings for privileged users for CC(U) elements that are proper subsets of U. More particularly, possible assignments of free riders to the subsets are examined, and an assignment is selected to fit an optimality criterion for the total set covering. In some embodiments, only "meeting point" elements of CC(U) are fully examined. A meeting point is an element containing at least two "immediate child" elements each of which contains a revoked user. An immediate child of a "parent" element is a proper subset of the parent with no intermediate elements (no elements containing the child as a proper subset and itself being a proper subset of the parent). An ordered list MP of meeting points is computed efficiently. The list is ordered by the number of elements in a chain from the meeting point to the root. The complete-subtree method is used in some embodiments. The methods have applications besides broadcast encryption, e.g. certificate revocation.
摘要翻译：在广播加密方案中，针对特权用户的集合P以及最多已被撤销的用户（“免费乘客”）的预定数量f计算覆盖CV（f，P）的最佳或接近最佳的集合。覆盖由用于所有用户U的集合的预定义集合封闭CC（U）的元素组成。通过为作为U的适当子集的CC（U）元素找到用于特权用户的优化或近似最佳覆盖来计算覆盖。更具体地说，检查可用的分配给子集的自由车手，并且选择一个分配以适合总集合覆盖的最优性准则。在一些实施例中，仅完全检查CC（U）的“会合点”元素。会议点是包含至少两个“直接子”“元素的元素，每个元素包含撤销的用户。 “父”元素的直接子代是没有中间元素的父类的正确子集（不包含子元素作为适当子集的子元素，并且本身是母体的正确子集）。有效地计算会议点的有序列表MP。列表由从会合点到根的链中的元素数量排序。在一些实施例中使用完全子树方法。除了广播加密之外，这些方法还具有应用。证书撤销。

IPRDB

热门服务

关于我们

友情链接

联系方式