-
1.发明申请PROTOCOL FOR DETERMINING AVAILABILITY OF PEERS IN A PEER-TO-PEER STORAGE SYSTEM 审中-公开用于确定同行存储系统中对等方的可用性的协议公开(公告)号：US20100088520A1
公开(公告)日：2010-04-08
申请号：US12244511
申请日：2008-10-02
申请人： Denis X. Charles , Siddhartha Puri
发明人： Denis X. Charles , Siddhartha Puri
CPC分类号： H04L67/104 , H04L63/0428 , H04L63/0807 , H04L63/126 , H04L67/108 , H04L67/1091
摘要： A method and system is provided for monitoring the availability of a peer in a P2P system that is used to provide remote storage or remote processing power. In one illustrative example, a recipient peer requests access to a service provisioned by another peer in a peer-to-peer network. The request may be a request to access a file or a file fragment that is being stored on the other peer. In order to make use of the accessed service, after receiving access to the service provisioned by the peer, the recipient peer needs to report to a central server that the service has been rendered. For instance, in some cases the file fragment accessed by the recipient peer may be encrypted, in which case the central server will send the recipient peer a decryption key after receiving the report that the service has been rendered.
摘要翻译： 提供了一种用于监视P2P系统中用于提供远程存储或远程处理能力的对等体的可用性的方法和系统。 在一个说明性示例中，接收者对等体请求对对等网络中由另一对等体提供的服务的访问。 该请求可以是访问存储在另一个对等体上的文件或文件片段的请求。 为了利用所访问的服务，在接收到由对等体提供的服务的访问之后，接收者对等体需要向中央服务器报告该服务已被呈现。 例如，在某些情况下，接收者对等体访问的文件片段可能被加密，在这种情况下，中央服务器将在收到服务已呈现的报告之后向接收方对方发送解密密钥。
-
公开(公告)号：US20100174968A1
公开(公告)日：2010-07-08
申请号：US12348072
申请日：2009-01-02
CPC分类号： H03M13/3761 , H03M13/373 , H04L67/104 , H04L67/108
摘要： Arrangements are provided for efficient erasure coding of files to be distributed and later retrieved from a peer-to-peer network, where such files are broken up into many fragments and stored at peer systems. The arrangements further provide a routine to determine the probability that the file can be reconstructed. The arrangements further provide a method of performing the erasure coding in an optimized fashion, allowing fewer occurrences of disk seeks.
摘要翻译： 提供了用于有效地擦除对待分发的文件进行擦除编码并随后从对等网络检索的文件，其中这些文件被分解成许多片段并存储在对等系统中。 这种安排进一步提供了一个程序来确定可以重构文件的概率。 该方案进一步提供了以优化的方式执行擦除编码的方法，允许更少的盘寻找出现。
-
公开(公告)号：US20090290714A1
公开(公告)日：2009-11-26
申请号：US12123688
申请日：2008-05-20
IPC分类号： H04L9/08
CPC分类号： H04L63/123 , G06F21/645 , H04L9/3242 , H04L9/3271 , H04L67/104
摘要： An exemplary method for verifying the integrity of remotely stored data includes providing a key; providing a fingerprint, the fingerprint generated using the key in a keyed cryptographic hash function as applied to data of known integrity; sending the key to a remote storage location that stores a copy of the data of known integrity; receiving a fingerprint from the remote storage location, the fingerprint generated using the key in a keyed cryptographic hash function as applied to the remotely stored copy of the data; and verifying the integrity of the remotely stored copy of the data based at least in part on comparing the provided fingerprint to the received fingerprint. Other exemplary methods, systems, etc., are also disclosed.
摘要翻译： 用于验证远程存储数据的完整性的示例性方法包括提供密钥; 提供指纹，使用密钥在密钥加密散列函数中生成的指纹，以应用于已知完整性的数据; 将密钥发送到存储已知完整性数据的副本的远程存储位置; 从所述远程存储位置接收指纹，使用所述密钥在密钥密码散列函数中生成的指纹应用于远程存储的数据副本; 以及至少部分地基于将所提供的指纹与所接收的指纹进行比较来验证远程存储的数据副本的完整性。 还公开了其它示例性方法，系统等。
-
公开(公告)号：US20110238490A1
公开(公告)日：2011-09-29
申请号：US12732031
申请日：2010-03-25
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0244 , G06Q30/0247 , G06Q30/0256 , G06Q30/0275
摘要： Various embodiments provide techniques for auction flighting. In one or more embodiments, a control group and a test group are designated for participants who compete one to another in online auctions. An inclusive model may then be employed for testing of new conditions for auctions using the groups. In particular, multiple auctions can be conducted and/or simulated, such that control conditions are applied in auctions that do not include at least one member of the test group, and test conditions are applied in auctions having members from both the test group and the control group. A response to the test conditions can then be measured by analyzing behaviors of the participants in the auctions conducted with the control conditions in comparison to behaviors of participants in the auctions conducted with the test conditions.
摘要翻译： 各种实施例提供拍卖飞行的技术。 在一个或多个实施例中，对照组和测试组被指定用于在线拍卖中彼此竞争的参与者。 然后可以使用包容性模型来测试使用这些组的拍卖的新条件。 特别地，可以进行和/或模拟多个拍卖，使得控制条件被应用于不包括测试组的至少一个成员的拍卖，并且测试条件被应用于具有来自测试组和 控制组。 然后可以通过分析与控制条件进行的拍卖的参与者的行为相比较，在与测试条件进行的拍卖中的参与者的行为相比较，来测量对测试条件的响应。
-
公开(公告)号：US20080301448A1
公开(公告)日：2008-12-04
申请号：US11757282
申请日：2007-06-01
申请人： Denis X. Charles , Kamal Jain , Kristin E. Lauter , Jin Li , Dan Teodosiu
发明人： Denis X. Charles , Kamal Jain , Kristin E. Lauter , Jin Li , Dan Teodosiu
IPC分类号： H04L9/00
CPC分类号： H04L9/3066 , H04L9/008 , H04L9/3247 , H04L2209/60
摘要： Systems and methods for security against corruption for networked storage are described. In one aspect, a destination device receives a linear combination of packets. The linear combination of packets represents digitally signed blocks of content and public information used to digitally sign segmented blocks of content. The destination device recombines the linear combination of packets to compute new valid signatures as linear combinations of received homomorphic digital signatures. The new valid signatures are for verifying by a requesting computing device recovering data associated with at least a subset of the linear combination of packets, integrity of the at least a subset. This provides the requesting node with security against corruption of data in networked storage.
摘要翻译： 描述了用于联网存储的用于防止损坏的安全性的系统和方法。 在一个方面，目的地设备接收分组的线性组合。 分组的线性组合表示用于对分段内容块进行数字签名的数字签名的内容块和公共信息。 目的地设备将分组的线性组合重新组合以计算新的有效签名作为接收的同态数字签名的线性组合。 新的有效签名用于由请求的计算设备验证恢复与分组的线性组合的至少一个子集相关联的数据，至少一个子集的完整性。 这为请求节点提供了防止网络存储中的数据损坏的安全性。
-
公开(公告)号：US20080141330A1
公开(公告)日：2008-06-12
申请号：US11567707
申请日：2006-12-06
申请人： Denis X. Charles , Kamal Jain , Kristin E. Lauter
发明人： Denis X. Charles , Kamal Jain , Kristin E. Lauter
CPC分类号： G06F21/64 , G06F21/6272
摘要： Systems and methods for digitally certified stationery are described. In one aspect, a stationery granting authority (SGA) receives a request from a user to generate a document. If the user is authorized for the requested document, the SGA generates a certificate with credentialing information from data in the request. The SGA generates a first digital signature from some of the credentialing information. The SGA communicates the certificate to the user for editing and distribution as the document. A recipient of the document determines whether the document is “official” by contacting a specified service to provide certain information from the document. The verification service computes a second digital signature from the provided information for comparison to the first digital signature. If there is a match, the service notifies the recipient that the document is valid/official. Otherwise, the recipient is notified that the document is not valid.
摘要翻译： 描述了数字认证的文具的系统和方法。 一方面，文具授予机构（SGA）从用户接收生成文档的请求。 如果用户被授权请求的文档，则SGA将从请求中的数据生成具有凭据信息的证书。 SGA从一些凭证信息生成第一个数字签名。 SGA将证书通信给用户进行编辑和分发作为文档。 文档的收件人通过联系指定的服务来确定文档是否“正式”，以从文档中提供某些信息。 验证服务根据提供的信息计算第二数字签名，以便与第一数字签名进行比较。 如果有匹配，则该服务通知收件人该文档是有效/正式的。 否则，通知收件人该文档无效。
-
公开(公告)号：US07702098B2
公开(公告)日：2010-04-20
申请号：US11080303
申请日：2005-03-15
CPC分类号： G06F7/725
摘要： Systems and methods for elliptic curve octupling for weighted projective coordinates are described. In one aspect, a weighted projective point P on an elliptic curve is identified. 8P is computed from P independent of repeated doubling operations using fewer field multiplications.
摘要翻译： 描述用于加权投影坐标的椭圆曲线八倍体的系统和方法。 在一方面，识别椭圆曲线上的加权投影点P. 8P是从独立于使用较少的场乘法的重复加倍运算的P计算的。
-
公开(公告)号：US20090287756A1
公开(公告)日：2009-11-19
申请号：US12510991
申请日：2009-07-28
IPC分类号： G06F17/17
CPC分类号： G06F7/725
摘要： Systems and methods for computing modular polynomials modulo large primes are described. In one aspect, the systems and methods generate l-isogenous elliptic curves. A modular polynomial modulo a large prime p is then computed as a function of l-isogenous elliptic curves modulo p.
摘要翻译： 描述了用于计算模多项式模数大素数的系统和方法。 在一个方面，系统和方法产生l个等式的椭圆曲线。 然后，模数为大素数p的模多项式作为模p的l-均质椭圆曲线的函数被计算。
-
公开(公告)号：US08922559B2
公开(公告)日：2014-12-30
申请号：US12748014
申请日：2010-03-26
CPC分类号： G06K9/6224 , G06F17/30958 , G06Q30/02 , G06Q30/08
摘要： Various embodiments provide techniques for graph clustering. In one or more embodiments, a participation graph is obtained that represents relationships between entities. An auxiliary graph is constructed based on the participation graph. The auxiliary graph may be constructed such that the auxiliary graph is less dense than the participation graph and is therefore computationally less complex to analyze. Clusters in the auxiliary graph are determined by solving an objective function defined for the auxiliary graph. Clusters determined for the auxiliary graph may then be utilized to ascertain clusters in the participation graph that solve a related objective function defined for the participation graph.
摘要翻译： 各种实施例提供了用于图形聚类的技术。 在一个或多个实施例中，获得表示实体之间的关系的参与图。 基于参与图构建辅助图。 辅助图可以被构造成使得辅助图不如参与图密度小，因此在计算上不太分析复杂。 辅助图中的簇通过求解辅助图定义的目标函数来确定。 然后可以使用为辅助图确定的群集来确定参与图中的聚类，以解决为参与图定义的相关目标函数。
-
公开(公告)号：US08028000B2
公开(公告)日：2011-09-27
申请号：US12038813
申请日：2008-02-28
CPC分类号： G06F17/3033 , G06F17/30424
摘要： Efficient data storage and retrieval (e.g., in terms of time and space requirements) is facilitated by implementing an indexing structure comprising an indexing array. That is, a functional relationship between elements of a source set and elements of a query result set can be stored in the indexing structure. This allows, for example, a query regarding whether an element is a member of a set (e.g., whether a particular website or Uniform Resource Locator (URL)) has been visited before) as well as a relationship between the member set and the query (e.g., the number of hyperlinks in the website the last time it was visited) to be resolved efficiently.
摘要翻译： 通过实现包括索引数组的索引结构，便于有效的数据存储和检索（例如，在时间和空间方面的要求方面）。 也就是说，源集合的元素和查询结果集合的元素之间的功能关系可以存储在索引结构中。 这允许例如关于元素是否是集合的成员（例如，是否已经访问过特定网站或统一资源定位符（URL））的查询）以及成员集和查询之间的关系 （例如，上次访问时网站中的超链接数）有效解决。
-
-
-
-
-
-
-
-
-
搜索结果
23 条记录 (耗时 0.021 秒)
