会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Memory bound functions for spam deterrence and the like
    • 用于垃圾邮件威慑的内存绑定功能等
    • US07149801B2
    • 2006-12-12
    • US10290879
    • 2002-11-08
    • Michael BurrowsMartin AbadiMark Steven ManasseEdward P. WobberDaniel Ron Simon
    • Michael BurrowsMartin AbadiMark Steven ManasseEdward P. WobberDaniel Ron Simon
    • G06F15/173H04K1/00
    • H04L63/126H04L51/12
    • A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. Such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we identify moderately hard, memory bound functions that most recent computer systems will evaluate at about the same speed, and we explain how to use them for protecting against abuses.
    • 如果用户投入很少或没有成本,资源可能会被滥用。 例如,电子邮件滥用是猖獗的,因为发送电子邮件对发件人的成本可以忽略不计。 通过以中等昂贵的计算的形式引入人造成本,可能不鼓励这种滥用。 因此,电子邮件的发件人可能需要在电子邮件被接受之前几秒计算才能付款。 不幸的是,由于计算机系统之间的差异很大,对于具有高端系统的恶意用户来说,这种方法可能无效,对于具有低端系统的合法用户或者两者都是非常缓慢的。 从这个观察开始,我们确定了最近的计算机系统以相同的速度评估的适度硬的记忆绑定功能,我们解释如何使用它们来防止滥用。
    • 2. 发明授权
    • Access control subsystem and method for distributed computer system
using compound principals
    • 使用复合主体的分布式计算机系统的访问控制子系统和方法
    • US5173939A
    • 1992-12-22
    • US783361
    • 1991-10-28
    • Martin AbadiMichael BurrowsEdward P. Wobber
    • Martin AbadiMichael BurrowsEdward P. Wobber
    • G06F9/46
    • G06F9/468Y10S707/99939
    • A distributed computer system has a number of computers coupled thereto at distinct nodes and a naming service with a membership table that defines a list of assumptions concerning which principals in the system are stronger than other principals, and which roles adopted by principals are stronger than other roles. Each object in the system has an access control list (ACL) having a list of entries. Each entry is either a simple principal or a compound principal. The set of allowed compound principals is limited to a predefined set of allowed combinations of simple principals, roles, delegations and conjunctions in accordance with a defined hierarchical ordering of the conjunction, delegation and role portions of each compound principal. The assumptions in the membership table reduce the number of entries needed in an ACL by allowing an entry to state only the weakest principals and roles that are to be allowed access. The reference checking process, handled by a reference monitor found at each node of the distributed system, grants an access request if the requestor is stronger than any one of the entries in the access control list for the resource requested. Furthermore, one entry is stronger than another entry if for each of the conjuncts in the latter entry there is a stronger conjunct in the former. Additional rules used by the reference monitor during the reference checking process govern the processes of comparing conjuncts in a requestor principal with the conjuncts in an access control list entry and of using assumptions to compare the relative strengths of principals and roles.
    • 分布式计算机系统具有多个与不同节点耦合的计算机,以及具有会员表的命名服务,该成员表定义了系统中哪些主体比其他主体更强的假设列表,以及由主体采用的角色比其他主体更强 角色。 系统中的每个对象都具有一个具有条目列表的访问控制列表(ACL)。 每个条目都是简单的主体或复合主体。 允许的复合主体的集合被限制为根据每个复合主体的连接,委派和角色部分的定义的分级顺序的简单主体,角色,委托和连接的允许的组合的预定义集合。 成员资格表中的假设通过允许条目仅指定允许访问的最弱主体和角色来减少ACL中所需的条目数。 如果请求者比所请求的资源的访问控制列表中的任何一个条目更强,由在分布式系统的每个节点处发现的参考监视器处理的参考检查过程就会授予访问请求。 此外,如果对于前一个条目中的每个连词都有一个更强的连接,则一个条目比另一个条目更强。 引用检查过程中参考监视器使用的附加规则管理将请求方主体中的连接与访问控制列表条目中的连接进行比较的过程,以及使用假设来比较主体和角色的相对强度。
    • 5. 发明授权
    • Searching for information utilizing a probabilistic detector
    • 使用概率检测器搜索信息
    • US07730058B2
    • 2010-06-01
    • US11243924
    • 2005-10-05
    • Gaurav SareenMark Steven ManasseMartin AbadiMichael A. Isard
    • Gaurav SareenMark Steven ManasseMartin AbadiMichael A. Isard
    • G06F7/00G06F17/30
    • G06F17/30687
    • A probabilistic detector is utilized to query a database. Utilization of a probabilistic detector provides assurance with 100 per cent probability that a search expression in the query is not in the database index. The probabilistic detector is implemented in the form of a Bloom filter. The probabilistic detector is created by hashing expressions in the database index and mapping the resulting hash values into the probabilistic detector. Upon receiving a query, expressions of the query are hashed. The probabilistic detector is queried using these hash values. If the results of querying the probabilistic detector indicate that searched for information may be in the database, the database is not queried. If the results of querying the probabilistic detector indicate that the information may be in the database, the database is queried for the information using the original query. This technique is advantageous in mitigating detrimental effects of denial of service attacks.
    • 利用概率检测器查询数据库。 概率检测器的利用率提供了100%的可能性,即查询中的搜索表达式不在数据库索引中。 概率检测器以Bloom滤波器的形式实现。 概率检测器是通过在数据库索引中散列表达式并将生成的散列值映射到概率检测器中创建的。 在接收到查询后,查询的表达式将被哈希。 使用这些散列值查询概率检测器。 如果查询概率检测器的结果表明搜索到的信息可能在数据库中,则不会查询数据库。 如果查询概率检测器的结果表明信息可能在数据库中,则使用原始查询查询数据库中的信息。 这种技术有利于减轻拒绝服务攻击的有害影响。
    • 9. 发明授权
    • Access control policy in a weakly-coherent distributed collection
    • 访问控制策略在弱连贯的分布式集合中
    • US08505065B2
    • 2013-08-06
    • US11765886
    • 2007-06-20
    • Edward P. WobberMartin AbadiThomas L. Rodeheffer
    • Edward P. WobberMartin AbadiThomas L. Rodeheffer
    • G06F17/00H04L29/06
    • G06F17/30578H04L9/12H04L9/321H04L9/3268H04L2209/60H04L2209/80
    • A system is disclosed for creating and implementing an access control policy framework in a weakly coherent distributed collection. A collection manager may sign certificates forming equivalence classes of replicas that share a specific authority. The collection manager and/or certain privileged replicas may issue certificates that delegate authority for control of item policy and replica policy. Further certificates may be signed that create one or more items, set policy for these one or more items, and define a set of operations authorized on the one or more items. The certificates issued according to the present system for creating and implementing a control policy framework cannot be modified or simply overridden. Once a policy certificate is issued, it may only be revoked by the collection manager or by a replica having revocation authority.
    • 公开了一种用于在弱相关分布式集合中创建和实现访问控制策略框架的系统。 收集管理员可以签署形成共享特定权限的副本的等价类的证书。 收集管理员和/或某些特权副本可能会颁发授权来管理项目策略和副本策略的证书。 可以签署创建一个或多个项目的其他证书,为这些一个或多个项目设置策略,并且定义一个或多个项目授权的一组操作。 根据本制度制定的颁发和实施控制政策框架的证书不能修改或简单地覆盖。 颁发政策证书后,只能由收款经理或具有撤销授权的副本撤销。