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

31. 发明授权

US07248691B1 Hashing using multiple sub-hashes 失效
标题翻译：散列使用多个子哈希值
公开(公告)号：US07248691B1
公开(公告)日：2007-07-24
申请号：US09704186
申请日：2000-10-31
申请人： Bhalchandra S. Pandit , Robert P. Reichel , Jeffrey B. Hamblin , Kedarnath A. Dubhashi
发明人： Bhalchandra S. Pandit , Robert P. Reichel , Jeffrey B. Hamblin , Kedarnath A. Dubhashi
IPC分类号： H04K1/00 , H04L9/00
CPC分类号： H04L9/3236 , H04L9/0643 , H04L9/3234 , H04L2209/38
摘要： A hashing structure including multiple sub-hashes is used to determine whether an input value matches one or more of multiple target values. These values can be of any form, such as security identifiers in an access control system. To make the determination, a hash key is obtained from the input value and multiple sub-hash indexes (one for each of the multiple sub-hashes) are generated based on the key. Values are identified from the multiple sub-hashes by indexing into the sub-hashes using respective ones of the sub-hash indexes. These values are then combined to generate a resultant hash value. Each of the multiple target values corresponds to one of multiple portions of the resultant hash value. If the portion corresponding to one of the target values has a particular value, then that target value is a likely match and is compared to the input value to determine if indeed the two match. This comparison can then be repeated for each target value with a corresponding portion in the resultant hash value that has the particular value.
摘要翻译：使用包括多个子哈希的哈希结构来确定输入值是否匹配多个目标值中的一个或多个。这些值可以是任何形式，例如访问控制系统中的安全标识符。为了确定，从输入值获得散列密钥，并且基于密钥生成多个子散列索引（对于多个子哈希中的每一个分别为一个）。通过使用相应的子哈希索引索引到子哈希中，从多个子哈希识别值。然后将这些值组合以生成合成的散列值。多个目标值中的每一个对应于所得到的散列值的多个部分之一。如果对应于目标值之一的部分具有特定值，则该目标值是可能的匹配，并且与输入值进行比较以确定两者是否匹配。然后可以对具有特定值的合成哈希值中的相应部分对每个目标值重复该比较。

32. 发明授权

US07096367B2 System and methods for caching in connection with authorization in a computer system 有权
公开(公告)号：US07096367B2
公开(公告)日：2006-08-22
申请号：US09849099
申请日：2001-05-04
申请人： Praerit Garg , Robert P. Reichel , Richard B. Ward , Kedarnath A. Dubhashi , Jeffrey B. Hamblin , Anne C. Hopkins
发明人： Praerit Garg , Robert P. Reichel , Richard B. Ward , Kedarnath A. Dubhashi , Jeffrey B. Hamblin , Anne C. Hopkins
IPC分类号： H04K1/00 , H04L9/00
CPC分类号： G06F21/6218 , G06F2221/2141 , Y10S707/99939
摘要： An authorization handle is supported for each access policy determination that is likely to be repeated. In particular, an authorization handle may be assigned to access check results associated with the same discretionary access control list and the same client context. This likelihood may be determined based upon pre-set criteria for the application or service, based on usage history and the like. Once an access policy determination is assigned an authorization handle, the static maximum allowed access is cached for that policy determination. From access check to access check, the set of permissions desired by the client may change, and dynamic factors that might affect the overall privilege grant may also change; however, generally there is still a set of policies that is unaffected by the changes and common across access requests. The cached static maximum allowed access data is thus used to provide efficient operations for the evaluation of common policy sets. In systems having access policy evaluations that are repeated, authorization policy evaluations are more efficient, computer resources are free for other tasks, and performance improvements are observed.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式