-
11.发明申请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系统中用于提供远程存储或远程处理能力的对等体的可用性的方法和系统。 在一个说明性示例中，接收者对等体请求对对等网络中由另一对等体提供的服务的访问。 该请求可以是访问存储在另一个对等体上的文件或文件片段的请求。 为了利用所访问的服务，在接收到由对等体提供的服务的访问之后，接收者对等体需要向中央服务器报告该服务已被呈现。 例如，在某些情况下，接收者对等体访问的文件片段可能被加密，在这种情况下，中央服务器将在收到服务已呈现的报告之后向接收方对方发送解密密钥。
-
公开(公告)号：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-均质椭圆曲线的函数被计算。
-
公开(公告)号：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））的查询）以及成员集和查询之间的关系 （例如，上次访问时网站中的超链接数）有效解决。
-
公开(公告)号：US07996677B2
公开(公告)日：2011-08-09
申请号：US11567707
申请日：2006-12-06
申请人： Denis X. Charles , Kamal Jain , Kristin E. Lauter
发明人： Denis X. Charles , Kamal Jain , Kristin E. Lauter
IPC分类号： H04L9/32
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将证书通信给用户进行编辑和分发作为文档。 文档的收件人通过联系指定的服务来确定文档是否“正式”，以从文档中提供某些信息。 验证服务根据所提供的信息计算第二数字签名，以便与第一数字签名进行比较。 如果有匹配，则该服务通知收件人该文档是有效/正式的。 否则，通知收件人该文档无效。
-
公开(公告)号：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.
摘要翻译： 提供了用于有效地擦除对待分发的文件进行擦除编码并随后从对等网络检索的文件，其中这些文件被分解成许多片段并存储在对等系统中。 这种安排进一步提供了一个程序来确定可以重构文件的概率。 该方案进一步提供了以优化的方式执行擦除编码的方法，允许更少的盘寻找出现。
-
公开(公告)号：US07680871B2
公开(公告)日：2010-03-16
申请号：US11275625
申请日：2006-01-19
IPC分类号： G06F17/10
摘要： Function properties may be approximated using an expander graph. For example, an approximate average of a function may be determined by randomly exploring an expander graph. Values of the function are associated with vertices of the expander graph. The expander graph is randomly explored by traversing edges and encountering vertices. The exploration may comprise a crawl, a walk, and so forth. An approximate average of the function is determined based on the function values that are associated with encountered vertices.
摘要翻译： 函数属性可以使用扩展器图近似。 例如，函数的近似平均值可以通过随机地浏览扩展器图来确定。 函数的值与扩展器图的顶点相关联。 通过遍历边缘并遇到顶点来随机探索扩展器图。 探索可能包括爬行，散步等等。 基于与遇到的顶点相关联的函数值来确定函数的近似平均值。
-
公开(公告)号：US20090290715A1
公开(公告)日：2009-11-26
申请号：US12123979
申请日：2008-05-20
CPC分类号： H04L63/062 , G06F21/335 , G06F2221/2151
摘要： An exemplary method includes receiving a request to register a peer in a peer-to-peer system; generating or selecting a transaction key for the peer; storing the transaction key in association with registration information for the peer; transmitting the transaction key to the peer and, in response to a request to perform a desired peer-to-peer transaction by another peer, generating a token, based at least in part on the transaction key. Such a token allows for secure transactions in a peer-to-peer system including remote storage of data and retrieval of remotely stored data. Other exemplary techniques are also disclosed including exemplary modules for a peer-to-peer server and peers in a peer-to-peer system.
摘要翻译： 一种示例性方法包括：在对等系统中接收注册对等体的请求; 生成或选择对等体的交易密钥; 存储与对等体的注册信息相关联的交易密钥; 将所述交易密钥发送到所述对等体，并且响应于至少部分地基于所述交易密钥来生成令牌的请求来执行所述对等交易所需的对等交易。 这样的令牌允许对等系统中的安全事务，包括远程存储数据和检索远程存储的数据。 还公开了其它示例性技术，其包括用于对等服务器和对等系统中的对等体的示例性模块。
-
公开(公告)号：US20080301815A1
公开(公告)日：2008-12-04
申请号：US11756599
申请日：2007-05-31
申请人： Kristin E. Lauter , Denis X. Charles , Kamal Jain
发明人： Kristin E. Lauter , Denis X. Charles , Kamal Jain
IPC分类号： G06F7/04
CPC分类号： G03G21/04 , H04N1/32144 , H04N2201/3235 , H04N2201/3236 , H04N2201/327 , H04N2201/3271
摘要： Systems and methods to detect unauthorized changes to a printed document are described. In one aspect, a digital signature of original content associated with electronic document is embedded into the original content to create a content signed document. The systems and methods use the embedded digital signature to automatically determine whether text-based content associated with a printout of the content signed document was changed from the original content associated with the electronic document.
摘要翻译： 描述了检测未经授权的更改打印文档的系统和方法。 一方面，将与电子文档相关联的原始内容的数字签名嵌入到原始内容中以创建内容签名文档。 系统和方法使用嵌入式数字签名来自动确定与内容签名文档的打印输出相关联的基于文本的内容是否从与电子文档相关联的原始内容中改变。
-
公开(公告)号：US08259932B2
公开(公告)日：2012-09-04
申请号：US12510991
申请日：2009-07-28
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. In one aspect, the modular polynomial may be used in a cryptosystem.
摘要翻译： 描述了用于计算模多项式模数大素数的系统和方法。 在一个方面，系统和方法产生l个等式的椭圆曲线。 然后，模数为大素数p的模多项式作为模p的l-均质椭圆曲线的函数被计算。 在一个方面，可以在密码系统中使用模块多项式。
-
20.发明申请公开(公告)号：US20100082992A1
公开(公告)日：2010-04-01
申请号：US12242801
申请日：2008-09-30
CPC分类号： H04L9/3073 , H04L9/3247 , H04L2209/60 , H04L2209/80
摘要： Techniques are disclosed for representing and evaluating large prime degree isogenies for use in cryptographic signature and encryption schemes. An isogeny of prime degree 1 may be represented as an ideal in the form (1, A*alpha+B), where 1 comprises the degree of a prime number, the prime number is split into integers a and b, and alpha is a known endomorphism. For a given degree 1, integers a and b define a unique isogeny, allowing the isogeny to be stored with 3 log(1) bits of information. Techniques are also disclosed to evaluate the isogeny at a given point by decomposing the isogeny into an integer and a plurality of smaller degree isogenies, evaluating the smaller degree isogenies at the point with traditional means, and multiplying the results of the evaluations together and with the integer.
摘要翻译： 公开了用于表示和评估用于加密签名和加密方案的大质量等值基因的技术。 素数1的均匀性可以表示为形式（1，A *α+ B）的理想，其中1包含质数的程度，素数被分解为整数a和b，而α是 已知的同态 对于给定的程度1，整数a和b定义了一个独特的等同原子，允许使用3个（1）位信息存储等值原理。 还公开了通过将均质分解成整数和多个较小程度的同基物质来评估给定点的同位素的技术，以传统方法评估较小程度的同基因，并将评估结果与 整数。
-
-
-
-
-
-
-
-
-
搜索结果
23 条记录 (耗时 0.025 秒)
