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

1. 发明申请

WO2016049406A1 METHOD AND APPARATUS FOR SECURE NON-INTERACTIVE THRESHOLD SIGNATURES 审中-公开
标题翻译：用于安全非交互式阈值信号的方法和装置
公开(公告)号：WO2016049406A1
公开(公告)日：2016-03-31
申请号：PCT/US2015/052129
申请日：2015-09-25
申请人： TECHNICOLOR USA, INC.
发明人： JOYE, Marc , LIBERT, Benoit
IPC分类号： H04L9/32
CPC分类号： H04L9/3255
摘要： The present principles provide a threshold signature scheme. Considering n players, given asymmetric bilinear groups (G, Ĝ, G T ) with generators g, h, g̃, h̃, X, Y ∈ R G and g̃ z , g̃ r ∈ R Ĝ, each player chooses a set of random t -degree polynomials, and generate a set of partial homomorphic signature on several linearly independent vectors. The public key PK may be obtained based on the set of polynomials and the partial homomorphic signatures of n players. The private key share and verification key for a player can be defined based on the set of polynomials. The signature for the message can be obtained from t partial signatures, wherein each partial signature can be generated based on the player's private key share and some random variables. Whether a partial signature is valid can be determined based on the public key PK and the verification key. Whether the signature for the message is valid can be determined based on the public key PK .
摘要翻译：本原理提供了阈值签名方案。考虑到n个玩家，给定不对称双线性组（G，Ĝ，GT）与发电机g，h，g，h，X，Y∈RG和gz，gr∈RĜ，每个玩家选择一组随机t度多项式，并在几个线性独立的向量上产生一组部分同态特征。可以基于n个播放器的多项式的集合和部分同态特征来获得公钥PK。可以基于多项式集来定义玩家的私钥共享和验证密钥。消息的签名可以从t部分签名获得，其中可以基于玩家的私钥共享和一些随机变量来生成每个部分签名。可以基于公钥PK和验证密钥来确定部分签名是否有效。可以基于公共密钥PK来确定消息的签名是否有效。

2. 发明申请

WO2016073057A3 METHOD AND APPARATUS FOR MAKING COCKS CIPHERTEXTS ANONYMOUS WITHOUT CIPHERTEXT EXPANSION 审中-公开
公开(公告)号：WO2016073057A3
公开(公告)日：2016-05-12
申请号：PCT/US2015/045804
申请日：2015-08-19
申请人： TECHNICOLOR USA, INC.
发明人： JOYE, Marc
IPC分类号： H04L9/30
摘要： Cocks scheme is an efficient identity-based encryption scheme whose semantic security relies on a standard assumption. In particular, it does not use bilinear maps (a.k.a pairings). Unlike most pairing-based schemes, Cocks scheme is not anonymous. The present embodiments provide methods for anonymizing Cocks ciphertexts. Previous 5 attempts in this direction resulted in longer ciphertexts or were quite impractical. The methods according to the present principles are computationally inexpensive and do not increase the size of the ciphertexts.

3. 发明申请

WO2016073056A2 METHOD AND APPARATUS FOR COMPUTING OVER COCKS CIPHERTEXTS 审中-公开
标题翻译：用于计算托管密码的方法和设备
公开(公告)号：WO2016073056A2
公开(公告)日：2016-05-12
申请号：PCT/US2015/045802
申请日：2015-08-19
申请人： TECHNICOLOR USA, INC.
发明人： JOYE, Marc
IPC分类号： H04L9/00
CPC分类号： H04L9/302 , H04L9/008 , H04L9/3073
摘要： Cocks scheme is an efficient identity-based encryption scheme whose semantic security relies on a standard assumption. In particular, it does not use bilinear maps (a.k.a. pairings). Computing over ciphertexts produced by Cocks scheme is an open problem. The present embodiments provide a method and system for computing over ciphertexts 5 produced by Cocks scheme. The proposed solution is constructive. It opens the way to new applications to Cocks scheme that were before not possible.
摘要翻译： Cocks方案是一种高效的基于身份的加密方案，其语义安全性依赖于标准假设。特别是，它不使用双线性映射（又名配对）。通过Cocks方案产生的密文计算是一个公开的问题。本实施例提供了一种用于通过Cocks方案产生的密文5的方法和系统。建议的解决方案是建设性的。它为以前无法实现的Cocks方案开辟了新的应用程序。

4. 发明申请

WO2016073058A2 METHOD AND APPARATUS FOR SECURE ELGAMAL-TYPE CRYPTOGRAPHY 审中-公开
标题翻译：用于安全的ELGAMAL型密码的方法和设备
公开(公告)号：WO2016073058A2
公开(公告)日：2016-05-12
申请号：PCT/US2015/045852
申请日：2015-08-19
申请人： TECHNICOLOR USA, INC
发明人： JOYE, Marc
IPC分类号： H04L9/30
CPC分类号： H04L9/3013
摘要： The present principles are directed to ElGamal-type cryptosystems where semantic security can be proved in the standard model without message encoding. In one embodiment, on input of security parameter λ the key generation algorithm generates a Sophie Germain prime q, and defines p = 2q + 1, a generator g of (Z/ρZ)*, and h = |g mods p|. The key generation algorithm chooses a random element x in Z/qZ and computes y = |h x mods p|. The public key is defined as pk = {h, p, q, y] while the secret key is defined as sk = {x}. The message space is a set comprising at most q elements; in one embodiment M = {1,..., q}. The encryption of a message m ∈ M is given by c = (c 1 , c 2 ) where c 1 =|h r mods p| and c 2 = |m y r mods p|, and the corresponding plaintext message m can be recovered using secret key x as m = |c 2 /c 1 x mods p|. The present principles also provide other embodiments that provide security against chosen-ciphertext attacks.
摘要翻译：本原理针对ElGamal型密码系统，其中可以在没有消息编码的标准模型中证明语义安全性。在一个实施例中，在输入安全参数λ时，密钥生成算法生成一个Sophie Germain素数q，并且定义p = 2q + 1，（Z /ρZ）*的生成器g和h = | g mods p |。密钥生成算法在Z / qZ中选择一个随机元素x并计算y = | h ^{mods p |。公钥被定义为pk = {h，p，q，y]，而秘密密钥被定义为sk = {x}。消息空间是一个包含至多q个元素的集合; 在一个实施例中，M = {1，...，q}。消息m∈M的加密由c =（c 1，c 2，...，c）给出，其中c 1 = | h ^{r mods p | 和c <2> = | my p |，并且相应的明文消息m可以使用密钥x恢复，如m = | c _{2 > / c _{1 ^{x mods p |。本原理还提供了提供针对选择密文攻击的安全性的其他实施例。}}}}}

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式