Reviewing cached user-group information in connection with issuing a digital rights management (DRM) license for content
    4.
    发明授权
    Reviewing cached user-group information in connection with issuing a digital rights management (DRM) license for content 失效
    查看缓存的用户组信息,以发布内容的数字版权管理(DRM)许可证

    公开(公告)号:US06990502B2

    公开(公告)日:2006-01-24

    申请号:US10374324

    申请日:2003-02-26

    IPC分类号: G06F17/30

    摘要: A computer network has storage devices organized into X levels and storing element-group information. To determine whether an element is a member of any target groups, each target group is validated by searching the storage devices to find a target group item and, if found, placing the target group in a validated target bin (V). Also, the element is validated by searching the storage devices to find an element item, and if found, determining from the item all groups that the element is listed as being a member of and placing such member-of groups in a search bin (S). If (S) intersects (V), the element is a member of a target group. If not, all groups in (S) are moved to a queue (Q1) corresponding to the storage device at level 1 and an iterative process searches for a membership path from the element to any target group.

    摘要翻译: 计算机网络具有组织成X级别并存储元素组信息的存储设备。 要确定元素是否是任何目标组的成员,通过搜索存储设备来查找目标组项,并且如果找到,将目标组放置在验证的目标bin(V)中,则每个目标组都被验证。 此外,通过搜索存储设备来查找元素项目来验证元素,并且如果发现,则从所有组中确定元素被列为成员的成员并将这些成员组放置在搜索仓(S )。 如果(S)与(V)相交,则该元素是目标组的成员。 如果不是,将(S)中的所有组移动到与级别1的存储设备相对应的队列(Q 1),并且迭代过程搜索从元素到任何目标组的成员资格路径。

    Issuing a digital rights management (DRM) license for content based on cross-forest directory information
    6.
    发明授权
    Issuing a digital rights management (DRM) license for content based on cross-forest directory information 有权
    根据跨林目录信息发布内容的数字版权管理(DRM)许可证

    公开(公告)号:US07827156B2

    公开(公告)日:2010-11-02

    申请号:US10374321

    申请日:2003-02-26

    IPC分类号: G06F7/00 G06F17/00 G06F17/30

    摘要: An organization maintains a computer network comprising at least a forest A and a forest B, where forest A has a directory A and a querying entity A capable of querying directory A, and forest B has a directory B and a querying entity B capable of querying directory B. Querying entity A receives a request from the user and decides whether to grant the request based at least in part on whether the user is a member of the group. Thus, querying entity A queries directory A to return information on the group, is directed to forest B, contacts querying entity B, requests querying entity B to query directory B whether the user is a member of the group, receives a response, and grants the request from the user based at least in part on whether the user is a member of the group.

    摘要翻译: 组织维护至少包含森林A和森林B的计算机网络,其中森林A具有目录A和能够查询目录A的查询实体A,林B具有能够查询的目录B和查询实体B 目录B.查询实体A至少部分地基于用户是否是组的成员,接收来自用户的请求并决定是否授予请求。 因此,查询实体A查询目录A以返回组上的信息,针对森林B,联系人查询实体B,请求查询实体B查询目录B用户是否是组的成员,接收响应,并且授予 来自用户的请求至少部分地基于用户是否是该组的成员。