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

1. 发明申请

US20090217042A1 PROVISIONAL SIGNATURE SCHEMES 审中-公开
公开(公告)号：US20090217042A1
公开(公告)日：2009-08-27
申请号：US12389295
申请日：2009-02-19
申请人： Zulfikar Ramzan , Craig Gentry , David Molnar
发明人： Zulfikar Ramzan , Craig Gentry , David Molnar
IPC分类号： H04L9/32
CPC分类号： H04L9/3218 , H04L9/3013 , H04L9/3066 , H04L9/3257 , H04L2209/42 , H04L2209/56
摘要： A method and apparatus for implementing portions of a provisional signature scheme are disclosed. In one embodiment, the method comprises creating a provisional signature by performing an operation on a message and completing the provisional signature to create a final signature on the message. Such a scheme may be used for server assisted signature schemes, designated confirmer signature schemes and blind signature schemes.

2. 发明申请

US20090217041A1 PROVISIONAL SIGNATURE SCHEMES 审中-公开
标题翻译：临时签字计划
公开(公告)号：US20090217041A1
公开(公告)日：2009-08-27
申请号：US12389287
申请日：2009-02-19
申请人： Zulfikar Ramzan , Craig Gentry , David Molnar
发明人： Zulfikar Ramzan , Craig Gentry , David Molnar
IPC分类号： H04L9/32
CPC分类号： H04L9/3218 , H04L9/3013 , H04L9/3066 , H04L9/3257 , H04L2209/42 , H04L2209/56
摘要： A method and apparatus for implementing portions of a provisional signature scheme are disclosed. In one embodiment, the method comprises creating a provisional signature by performing an operation on a message and completing the provisional signature to create a final signature on the message. Such a scheme may be used for server assisted signature schemes, designated confirmer signature schemes and blind signature schemes.
摘要翻译：公开了一种用于实现临时签名方案的部分的方法和装置。在一个实施例中，该方法包括通过对消息执行操作并完成临时签名来创建临时签名以在消息上创建最终签名。这种方案可以用于服务器辅助签名方案，指定的确认者签名方案和盲签名方案。

3. 发明授权

US07730319B2 Provisional signature schemes 失效
标题翻译：临时签名计划
公开(公告)号：US07730319B2
公开(公告)日：2010-06-01
申请号：US11215550
申请日：2005-08-29
申请人： Zulfikar Ramzan , Craig Gentry , David Molnar
发明人： Zulfikar Ramzan , Craig Gentry , David Molnar
IPC分类号： H04L9/28
CPC分类号： H04L9/3218 , H04L9/3013 , H04L9/3066 , H04L9/3257 , H04L2209/42 , H04L2209/56
摘要： A method and apparatus for implementing portions of a provisional signature scheme are disclosed. In one embodiment, the method comprises creating a provisional signature by performing an operation on a message and completing the provisional signature to create a final signature on the message. Such a scheme may be used for server assisted signature schemes, designated confirmer signature schemes and blind signature schemes.
摘要翻译：公开了一种用于实现临时签名方案的部分的方法和装置。在一个实施例中，该方法包括通过对消息执行操作并完成临时签名来创建临时签名以在消息上创建最终签名。这种方案可以用于服务器辅助签名方案，指定的确认者签名方案和盲签名方案。

4. 发明申请

US20060056621A1 Provisional signature schemes 失效
标题翻译：临时签名计划
公开(公告)号：US20060056621A1
公开(公告)日：2006-03-16
申请号：US11215550
申请日：2005-08-29
申请人： Zulfikar Ramzan , Craig Gentry , David Molnar
发明人： Zulfikar Ramzan , Craig Gentry , David Molnar
IPC分类号： H04L9/28
CPC分类号： H04L9/3218 , H04L9/3013 , H04L9/3066 , H04L9/3257 , H04L2209/42 , H04L2209/56
摘要： A method and apparatus for implementing portions of a provisional signature scheme are disclosed. In one embodiment, the method comprises creating a provisional signature by performing an operation on a message and completing the provisional signature to create a final signature on the message. Such a scheme may be used for server assisted signature schemes, designated confirmer signature schemes and blind signature schemes.
摘要翻译：公开了一种用于实现临时签名方案的部分的方法和装置。在一个实施例中，该方法包括通过对消息执行操作并完成临时签名来创建临时签名以在消息上创建最终签名。这种方案可以用于服务器辅助签名方案，指定的确认者签名方案和盲签名方案。

5. 发明申请

US20070168659A1 GENERATION OF SET COVERINGS WITH FREE RIDERS, AND GENERATION OF ORDERED SETS OF MEETING POINTS, IN SYSTEMS WHICH INCLUDE, BUT ARE NOT LIMITED TO, SYSTEMS FOR BROADCAST ENCRYPTION AND SYSTEMS FOR CERTIFICATE REVOCATION 有权
标题翻译：产生无盖骑手的套装，以及订单会议点的生成，包括但不限于广播加密和系统进行证书转让的系统
公开(公告)号：US20070168659A1
公开(公告)日：2007-07-19
申请号：US11561096
申请日：2006-11-17
申请人： Craig Gentry , Zulfikar Ramzan , David Woodruff
发明人： Craig Gentry , Zulfikar Ramzan , David Woodruff
IPC分类号： H04L9/00
CPC分类号： H04L9/0822 , H04L9/3265 , H04L9/3268 , H04L2209/601
摘要： In a broadcast encryption scheme, an optimal or near-optimal set covering CV(f,P) is computed for a set P of privileged users and at most a predefined number f of revoked users (“free riders”). The covering consists of elements of a predefined set cover CC(U) for the set of all users U. The covering is computed by finding optimal or near-optimal coverings for privileged users for CC(U) elements that are proper subsets of U. More particularly, possible assignments of free riders to the subsets are examined, and an assignment is selected to fit an optimality criterion for the total set covering. In some embodiments, only “meeting point” elements of CC(U) are fully examined. A meeting point is an element containing at least two “immediate child” elements each of which contains a revoked user. An immediate child of a “parent” element is a proper subset of the parent with no intermediate elements (no elements containing the child as a proper subset and itself being a proper subset of the parent). An ordered list MP of meeting points is computed efficiently. The list is ordered by the number of elements in a chain from the meeting point to the root. The complete-subtree method is used in some embodiments. The methods have applications besides broadcast encryption, e.g. certificate revocation.
摘要翻译：在广播加密方案中，针对特权用户的集合P以及最多已被撤销的用户（“免费乘客”）的预定数量f计算覆盖CV（f，P）的最佳或接近最优集合。覆盖由用于所有用户U的集合的预定义集合封闭CC（U）的元素组成。通过为作为U的适当子集的CC（U）元素找到用于特权用户的优化或近似最佳覆盖来计算覆盖。更具体地说，检查可用的分配给子集的自由车手，并且选择一个分配以适合总集合覆盖的最优性准则。在一些实施例中，仅完全检查CC（U）的“会合点”要素。会议点是包含至少两个“直接子”“元素的元素，每个元素包含撤销的用户。 “父”元素的直接子代是没有中间元素的父类的正确子集（不包含子元素作为适当子集的子元素，并且本身是母体的正确子集）。有效地计算会议点的有序列表MP。列表由从会合点到根的链中的元素数量排序。在一些实施例中使用完全子树方法。除了广播加密之外，这些方法还具有应用。证书撤销。

6. 发明申请

US20070180003A1 EXCLUSIVE SET SYSTEM CONSTRUCTIONS INCLUDING, BUT NOT LIMITED TO, APPLICATIONS TO BROADCAST ENCRYPTION AND CERTIFICATE REVOCATION 有权
标题翻译：独家设置系统构造，包括但不限于应用于广播加密和证书转让
公开(公告)号：US20070180003A1
公开(公告)日：2007-08-02
申请号：US11554405
申请日：2006-10-30
申请人： Craig Gentry , Zulfikar Ramzan , David Woodruff
发明人： Craig Gentry , Zulfikar Ramzan , David Woodruff
IPC分类号： G06F3/00
CPC分类号： H04L9/0836 , H04L9/3093 , H04L9/3268 , H04L2209/601
摘要： An (n,k,r,t)-exclusive set system over a set U includes elements Sƒ each of corresponds to a polynomial ƒ(u) in one or more coordinates of uεU. The polynomial is zero on U\Sƒ but is not zero on Sƒ. In some embodiments, an asymptotically low key complexity k is provided.
摘要翻译：在集合U中的An（n，k，r，t） - 独特集合系统包括每个对应于uepsilonU的一个或多个坐标中的多项式f（u）的元素。多项式在U \ S 上为零，但在S 上不为零。在一些实施例中，提供渐近低密钥复杂度k。

7. 发明申请

US20060248334A1 Use of modular roots to perform authentication including, but not limited to, authentication of validity of digital certificates 失效
标题翻译：使用模块化根执行认证，包括但不限于认证数字证书的有效性
公开(公告)号：US20060248334A1
公开(公告)日：2006-11-02
申请号：US11454262
申请日：2006-06-16
申请人： Zulfikar Ramzan , Craig Gentry , Bernhard Bruhn
发明人： Zulfikar Ramzan , Craig Gentry , Bernhard Bruhn
IPC分类号： H04L9/00
CPC分类号： G06F21/33 , H04L9/3218 , H04L9/3268 , H04L2209/30 , H04L2209/38 , H04L2209/56 , H04L2209/80
摘要： Authentication of elements (e.g. digital certificates 140) as possessing a pre-specified property (e.g. being valid) or not possessing the property is performed by (1) assigning a distinct integer pi to each element, and (2) accumulating the elements possessing the property or the elements not possessing the property using a P-th root u1/P (mod n) of an integer u modulo a predefined composite integer n, where P is the product of the integers associated with the accumulated elements. Alternatively, authentication is performed without such accumulators but using witnesses associated with such accumulators. The witnesses are used to derive encryption and/or decryption keys for encrypting the data evidencing possession of the property for multiple periods of time. The encrypted data are distributed in advance. For each period of time, decryption keys are released which are associated with that period and with the elements to be authenticated in that period of time. Authentication can be performed by accumulating elements into data which are a function of each element but whose size does not depend on the number of elements, and transmitting the accumulator data over a network to a computer system which de-accumulates some elements as needed to re-transmit only data associated with elements needed by other computer systems. This technique is suitable to facilitate distribution of accumulator data in networks such as ad hoc networks.
摘要翻译：通过（1）向每个元素分配不同的整数p 来执行具有预先指定的属性（例如有效）或不具有该属性的元素（例如数字证书140）的认证，以及（2）使用预定义的复合整数n的整数u的P个根u 1 / P（mod n）累积具有该属性的元素或不具有该属性的元素，其中P 是与累积元素相关联的整数的乘积。或者，在没有这样的累加器的情况下执行认证，但是使用与这种累加器相关联的证人。证人被用于导出加密和/或解密密钥，用于加密证明拥有属性多个时间段的数据。加密数据预先分配。对于每个时间段，释放与那段时间相关联的解密密钥以及在该时间段内被认证的元素。认证可以通过将元素累加到数据中来执行，该数据是每个元素的函数，但其大小不依赖于元素的数量，并且通过网络将累加器数据发送到计算机系统，其根据需要去累积一些元素 - 仅传输与其他计算机系统所需的元素相关联的数据。该技术适合于促进诸如ad hoc网络的网络中的累加器数据的分配。

8. 发明申请

US20050259817A1 Method and apparatus for communication efficient private information retrieval and oblivious transfer 有权
标题翻译：用于通信有效的私人信息检索和遗忘转移的方法和装置
公开(公告)号：US20050259817A1
公开(公告)日：2005-11-24
申请号：US11133836
申请日：2005-05-19
申请人： Zulfikar Ramzan , Craig Gentry
发明人： Zulfikar Ramzan , Craig Gentry
IPC分类号： G06F17/30 , G06F21/00 , H04L9/00 , H04L9/30
CPC分类号： G06F21/6254 , G06F21/6227 , H04L9/3013 , H04L2209/16 , H04L2209/50 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99938 , Y10S707/99939 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944
摘要： A method, article of manufacture and apparatus for performing private retrieval of information from a database is disclosed. In one embodiment, the method comprising obtaining an index corresponding to information to be retrieved from the database and generating a query that does not reveal the index to the database. The query is an arithmetic function of the index and a secret value, wherein the arithmetic function includes a multiplication group specified by a modulus of a random value whose order is divisible by a prime power, such that the prime power is an order of the random value. The secret value is an arithmetic function of the index that comprises a factorization into prime numbers of the modulus. The method further comprises communicating the query to the database for execution of the arithmetic function against the entirety of the database.
摘要翻译：公开了一种用于从数据库执行信息私有检索的方法，制品和装置。在一个实施例中，该方法包括获得与从数据库检索的信息相对应的索引，并生成不向数据库显示索引的查询。查询是索引的算术函数和秘密值，其中算术函数包括由序列可由素数幂整除的随机值的模数指定的乘法组，使得素数是随机的次序值。秘密值是索引的算术函数，该函数包括分解为素数的素数。该方法还包括将查询传送到数据库，以针对数据库的整体执行算术功能。

9. 发明申请

US20070016769A1 Broadcast encryption using rsa 有权
标题翻译：使用rsa进行广播加密
公开(公告)号：US20070016769A1
公开(公告)日：2007-01-18
申请号：US10544060
申请日：2004-05-21
申请人： Craig Gentry , Zulfikar Ramzan
发明人： Craig Gentry , Zulfikar Ramzan
IPC分类号： H04L9/00
CPC分类号： H04H60/23 , H04L9/0836 , H04L9/302 , H04L2209/601
摘要： Methods, components and systems for implementing secure and efficient broadcast encryption schemes with configurable and practical tradeoffs among a pre-broadcast transmission bandwidth t, a key storage cost k, and a key derivation cost c, in which the schemes use subtree difference and key decomposition to generate secondary keys, use the secondary keys to encrypt the broadcast and generate ciphertexts, and use the RSA encryption scheme to implement derivability between the primary keys and the secondary keys. To decrypt the broadcast, a privileged user uses one of its primary keys to derive a secondary key, which is used to decrypt the broadcast. The product of key derivation costc and the key storage cost k is at most (2a−log a−2)loga n, when n is the number of users, 1≦b≦log n, a=2b, and revoked users r
摘要翻译：用于实现安全和有效的广播加密方案的方法，组件和系统，其中广播传输带宽t，密钥存储成本k和密钥导出成本c之间具有可配置和实际的权衡，其中方案使用子树差分和密钥分解生成辅助密钥，使用辅助密钥加密广播并生成密文，并使用RSA加密方案来实现主密钥和次密钥之间的派生。为了对广播进行解密，特权用户使用其主键之一来导出用于解密广播的辅助密钥。当n是用户数时，密钥导出costc和密钥存储成本k的乘积最多为（2a-log a-2）log N a n，n 1 = ，A = 2＆lt; b＆gt;和撤销用户r

10. 发明申请

US20060291661A1 Cryptographic authentication and/or establishment of shared cryptographic keys, including, but not limited to, password authenticated key exchange (PAKE) 有权
标题翻译：加密认证和/或共享加密密钥的建立，包括但不限于密码认证密钥交换（PAKE）
公开(公告)号：US20060291661A1
公开(公告)日：2006-12-28
申请号：US11415558
申请日：2006-05-01
申请人： Zulfikar Ramzan , Craig Gentry , Philip Mackenzie
发明人： Zulfikar Ramzan , Craig Gentry , Philip Mackenzie
IPC分类号： H04L9/00
CPC分类号： H04L63/083 , H04L9/0844
摘要： A server (120) uses a password (π) to construct a multiplicative group (ZN*) with a (hidden) smooth order subgroup ( ), where the group order (Pπ) depends on the password. The client (110) uses its knowledge of the password to generate a root extraction problem instance (z) in the group and to generate data (y) allowing the server to construct a discrete logarithm problem instance (y′) in the subgroup. The server uses its knowledge of the group order to solve the root extraction problem, and solves the discrete logarithm problem efficiently by leveraging the smoothness of the subgroup. A shared key (sk) can be computed as a function of the solutions to the discrete logarithm and root extraction problem instances. In some embodiments, in an oblivious transfer protocol, the server queries the client (at 230) for data whose position in a database (210) is defined by the password. The client provides (240) such data without knowing the data position associated with the server's query. The client obtains the data position independently from the password. The data positions and/or the respective data are used for authentication and shared secret key generation. Other embodiments are also provided.
摘要翻译：服务器（120）使用密码（pi）用（隐藏）平滑顺序子组（）构建乘法组（Z N N N *），其中组顺序（P < SUB> pi ）取决于密码。客户端（110）使用其密码知识来生成组中的根提取问题实例（z），并生成允许服务器构建子组中的离散对数问题实例（y'）的数据（y）。服务器利用群组顺序的知识来解决根提取问题，通过利用子群的平滑度来有效解决离散对数问题。共享密钥（sk）可以作为离散对数和根提取问题实例的解的函数来计算。在一些实施例中，在遗忘的传输协议中，服务器向客户端（在230处）查询其数据库（210）中的位置由密码定义的数据。客户端提供（240）这样的数据，而不知道与服务器的查询相关联的数据位置。客户端独立于密码获取数据位置。数据位置和/或相应数据用于认证和共享密钥生成。还提供了其他实施例。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式