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

1. 发明申请

WO2014137394A1 PRIVACY-PRESERVING RIDGE REGRESSION USING PARTIALLY HOMOMORPHIC ENCRYPTION AND MASKS 审中-公开
标题翻译：使用部分均匀加密和掩码的隐私保护RIDGE回归
公开(公告)号：WO2014137394A1
公开(公告)日：2014-09-12
申请号：PCT/US2013/061698
申请日：2013-09-25
申请人： THOMSON LICENSING , NIKOLAENKO, Valeria , WEINSBERG, Udi , IOANNIDIS, Stratis , JOYE, Marc , TAFT, Nina
发明人： NIKOLAENKO, Valeria , WEINSBERG, Udi , IOANNIDIS, Stratis , JOYE, Marc , TAFT, Nina
IPC分类号： H04L9/00
CPC分类号： H04L9/008 , G06F21/602 , G09C1/00 , H04L9/0816 , H04L63/0428 , H04L2209/04 , H04L2209/24 , H04L2209/46 , H04L2209/50
摘要： A method and system for privacy-preserving ridge regression using partially homomorphic encryption and masks is provided. The method includes the steps of requesting a garbled circuit from a crypto service provider, collecting data from multiple users that has been formatted and encrypted using partially homomorphic encryption, summing the data that has been formatted and encrypted using partially homomorphic encryption, applying a prepared masks to the summed data, receiving garbled inputs corresponding to prepared mask from the crypto service provider using oblivious transfer, and evaluating the garbled circuit from the crypto service provider using the garbled inputs and masked data.
摘要翻译：提供了一种使用部分同态加密和掩码进行隐私保护岭回归的方法和系统。该方法包括以下步骤：从加密服务提供商请求混乱电路，从已经使用部分同态加密格式化和加密的多个用户收集数据，对已经使用部分同态加密格式化和加密的数据求和，应用准备的掩码对于相加的数据，使用无意识的转移从加密服务提供商接收与准备的掩码相对应的乱码，并且使用乱码输入和掩蔽数据从加密服务提供商评估乱码电路。

2. 发明申请

WO2014137393A1 PRIVACY-PRESERVING RIDGE REGRESSION USING MASKS 审中-公开
标题翻译：隐私保护使用掩码的RIDGE回归
公开(公告)号：WO2014137393A1
公开(公告)日：2014-09-12
申请号：PCT/US2013/061696
申请日：2013-09-25
申请人： THOMSON LICENSING , NIKOLAENKO, Valeria , WEINSBERG, Udi , IOANNIDIS, Stratis , JOYE, Marc , TAFT, Nina
发明人： NIKOLAENKO, Valeria , WEINSBERG, Udi , IOANNIDIS, Stratis , JOYE, Marc , TAFT, Nina
IPC分类号： H04L9/00
CPC分类号： H04L9/008 , G06F21/602 , G09C1/00 , H04L9/0816 , H04L63/0428 , H04L2209/04 , H04L2209/24 , H04L2209/46 , H04L2209/50
摘要： A method and system for privacy-preserving ridge regression using masks is provided. The method includes the steps of requesting a garbled circuit from a crypto service provider, collecting data from multiple users that has been formatted and encrypted using homomorphic encryption, summing the data that has been formatted and encrypted using homomorphic encryption, applying prepared masks to the summed data, receiving garbled inputs corresponding to prepared mask from the crypto service provider using oblivious transfer, and evaluating the garbled circuit from the crypto service provider using the garbled inputs and masked data.
摘要翻译：提供了一种使用掩模进行隐私保护脊回归的方法和系统。该方法包括以下步骤：从加密服务提供商请求乱码电路，从使用同态加密格式化和加密的多个用户收集数据，对已经被格式化并使用同态加密加密的数据求和，将准备的掩码应用于求和数据，使用无意识的传送从加密服务提供者接收与准备的掩码相对应的乱码输入，以及使用乱码输入和掩蔽数据从加密服务提供商评估混乱电路。

3. 发明申请

WO2014137392A1 PRIVACY-PRESERVING RIDGE REGRESSION 审中-公开
标题翻译：隐私保护RIDGE REGRESSION
公开(公告)号：WO2014137392A1
公开(公告)日：2014-09-12
申请号：PCT/US2013/061690
申请日：2013-09-25
申请人： THOMSON LICENSING , NIKOLAENKO, Valeria , WEINSBERG, Udi , IOANNIDIS, Stratis , JOYE, Marc , TAFT, Nina
发明人： NIKOLAENKO, Valeria , WEINSBERG, Udi , IOANNIDIS, Stratis , JOYE, Marc , TAFT, Nina
IPC分类号： H04L9/00
CPC分类号： H04L9/008 , G06F21/602 , G09C1/00 , H04L9/0816 , H04L63/0428 , H04L2209/04 , H04L2209/24 , H04L2209/46 , H04L2209/50
摘要： A hybrid approach to privacy-preserving ridge regression is presented that uses both homomorphic encryption and Yao garbled circuits. Users in the system submit their data encrypted under a linearly homomorphic encryption. The linear homomorphism is used to carry out the first phase of the algorithm that requires only linear operations. The output of this phase generates encrypted data, in a form that is independent of the number of users n . In a second phase, a Yao garbled circuit that first implements homomorphic decryption and then does the rest of the regression algorithm (as shown, an optimized realization can avoid decryption in the garbled circuit) is evaluated. For this step a Yao garbled circuit approach is much faster than current fully homomorphic encryption schemes. Thus the best of both worlds is obtained by using linear homomorphisms to handle a large data set and using garbled circuits for the heavy non-linear part of the computation.
摘要翻译：提出了一种使用隐形保护脊回归的混合方法，其使用同态加密和姚乱码电路。系统中的用户在线性同态加密下提交加密的数据。线性同态用于执行仅需要线性运算的算法的第一阶段。该阶段的输出以独立于用户数n的形式生成加密数据。在第二阶段，首先实现同态解密，然后进行剩余的回归算法（如图所示，优化的实现可以避免乱码电路中的解密）的Yao混乱电路被评估。对于这一步骤，姚瑶混乱电路方法比当前的完全同态加密方案快得多。因此，通过使用线性同态来处理大数据集并且使用用于计算的重非线性部分的乱码电路来获得两个世界中最好的。

4. 发明申请

WO2014137449A3 A METHOD AND SYSTEM FOR PRIVACY PRESERVING COUNTING 审中-公开
公开(公告)号：WO2014137449A3
公开(公告)日：2014-09-12
申请号：PCT/US2013/076353
申请日：2013-12-19
申请人： THOMSON LICENSING , IOANNIDIS, Efstratios , WEINSBERG, Ehud , TAFT, Nina, Anne , JOYE, Marc , NIKOLAENKO, Valeria
发明人： IOANNIDIS, Efstratios , WEINSBERG, Ehud , TAFT, Nina, Anne , JOYE, Marc , NIKOLAENKO, Valeria
IPC分类号： H04L9/00
摘要： A method for counting securely comprising receiving as input a set of records, wherein said set of records comprises at least one record, each record including a set of tokens, wherein said set of tokens comprises at least one token; receiving a separate set of tokens including at least one token and processing the set of records and the separate set of tokens to count in how many records each token belonging to the separate set of tokens appears without learning the contents of any individual record and of any information extracted from the records other than the counts.

5. 发明申请

WO2009095491A1 A DEVICE, METHOD AND A COMPUTER PROGRAM PRODUCT FOR CALCULATING ADDITIONS OF POINTS ON ELLIPTIC CURVES IN EDWARDS FORM 审中-公开
标题翻译：一种用于计算EDWARDS表格中ELLIPTIC曲线点的附加值的装置，方法和计算机程序产品
公开(公告)号：WO2009095491A1
公开(公告)日：2009-08-06
申请号：PCT/EP2009/051096
申请日：2009-01-30
申请人： THOMSON LICENSING , JOYE, Marc
发明人： JOYE, Marc
IPC分类号： G06F7/72
CPC分类号： G06F7/725 , G06F2207/7261
摘要： A device (100) for calculations on elliptic curves. The elliptic curve in generalized Edwards form is projected on a projective form so that a point P = (x 1 , y 1 ) on the elliptic curve is represented by the tuple (x 1 Z 1 : y 1 Z 1 : Z 1 ) for any Z 1 ≠ 0. An addition of two projective points (X 1 : V 1 : Z 1 ) and (X 2 : V 2 : Z 2 ) is given by X 3 = Z 1 Z 2 (X 1 Y 2 + X 2 Y 1 )M, Y 3 = Z 1 Z 2 (Y 1 Y 2 - e X 1 X 2 )N, and Z 3 = MN, where M = f Z 1 2 Z 2 2 - d X 1 X 2 Y 1 Y 2 and N = f Z 1 2 Z 2 2 + d X 1 X 2 Y 1 Y 2 . By rewriting X 1 Y 2 + X 2 Y 1 as (X 1 + Y 1 )(X 2 + Y 2 ) - X 1 Y 1 - X 2 Y 2 , this costs 10M+ 1 S + 1 d + 1 e + 1 f where M denotes a field multiplication, S denotes a field squaring, and d, e, f denote respectively a multiplication by constants d, e, f . Also provided is a special doubling formula, a method, and a computer program (140).
摘要翻译：用于在椭圆曲线上计算的装置（100）。广义爱德华兹形式的椭圆曲线投影在投影形式上，使得椭圆曲线上的点P =（x1，y1）由任何Z1的元组（x1Z1：y1Z1：Z1）表示。通过X3 = Z1Z2（X1 Y2 + X2Y1）M，Y3 = Z1Z2（Y1 Y2-e X1X2）N给出两个投影点（X1：V1：Z1）和（X2：V2：Z2）的相加， Z3 = MN，其中M = f Z1 2Z2 2 -d X1X2Y1Y2和N = f Z1 2Z2 2 + d X1X2Y1 Y2。通过将X1 Y2 + X2Y1重写为（X1 + Y1）（X2 + Y2）-X1 Y1-X2Y2，则成本为10M + 1 S + 1 d + 1 e + 1 f其中M表示场乘法，S表示场平方， d，e，f分别表示常数d，e，f的相乘。还提供了特殊的加倍公式，方法和计算机程序（140）。

6. 发明申请

WO2013004691A1 TRAITOR TRACING FOR SOFTWARE-IMPLEMENTED DECRYPTION ALGORITHMS 审中-公开
公开(公告)号：WO2013004691A1
公开(公告)日：2013-01-10
申请号：PCT/EP2012/062910
申请日：2012-07-03
申请人： THOMSON LICENSING , JOYE, Marc , LEPOINT, Tancrède
发明人： JOYE, Marc , LEPOINT, Tancrède
IPC分类号： H04L9/00 , H04L9/32
CPC分类号： H04L9/3236 , H04L9/085 , H04L9/3249 , H04L2209/606
摘要： A traitor tracing method. Each decryption process is made available as a user-specific protected software implementation (decoder). When some digital content is encrypted, a legitimate user can recover the content in clear using its own private decoder. Moreover, it is possible to trace a decoder in case it is suspected to be an illegal copy.
摘要翻译：叛徒追踪法。每个解密过程作为用户特定的保护软件实现（解码器）可用。当一些数字内容被加密时，合法用户可以使用其自己的私有解码器清除内容。此外，有可能跟踪解码器，以防其被怀疑是非法副本。

7. 发明申请

WO2010145983A1 A METHOD AND A DEVICE FOR PERFORMING TORUS-BASED CRYPTOGRAPHY 审中-公开
标题翻译：一种用于执行基于多普勒频率分析的方法和装置
公开(公告)号：WO2010145983A1
公开(公告)日：2010-12-23
申请号：PCT/EP2010/058131
申请日：2010-06-10
申请人： THOMSON LICENSING , JOYE, Marc
发明人： JOYE, Marc
IPC分类号： H04L9/30 , H04L9/32
CPC分类号： H04L9/3013 , H04L9/302 , H04L9/3255 , H04L2209/12 , H04L2209/30
摘要： At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. The present invention extends their setting to the ring of integers modulo N , thus obtaining compact representations for cryptographic systems that base their security on the discrete logarithm problem and the factoring problem. This can result in small key sizes and substantial savings in memory and bandwidth. However, unlike the case of finite field, analogous trace-based compression methods cannot be adapted to accommodate the extended setting of the invention when the underlying systems require more than a mere exponentiation. The invention finds particular application in a torus-based implementation of the ACJT group signature scheme. Also provided is a processor (10).
摘要翻译：在CRYPTO 2003年，Rubin和Silverberg在有限的领域上介绍了基于环面的加密技术的概念。本发明将它们的设置扩展到模N的整数环，从而获得基于离散对数问题和保理问题的安全性的密码系统的紧凑表示。这可能导致小的密钥大小，并显着节省内存和带宽。然而，与有限域的情况不同，当底层系统需要的不仅仅是求幂时，类似的基于跟踪的压缩方法不能适应于适应本发明的扩展设置。本发明在ACJT组签名方案的基于环面的实现中发现具体应用。还提供了处理器（10）。

8. 发明申请

WO2010105900A1 EXPONENTIATION METHOD RESISTANT AGAINST SIDE-CHANNEL AND SAFE-ERROR ATTACKS 审中-公开
标题翻译：防止侧向通道和安全错误攻击的指导方法
公开(公告)号：WO2010105900A1
公开(公告)日：2010-09-23
申请号：PCT/EP2010/052565
申请日：2010-03-01
申请人： THOMSON LICENSING , JOYE, Marc
发明人： JOYE, Marc
IPC分类号： G06F7/72
CPC分类号： H04L9/002 , G06F7/38 , G06F7/72 , G06F7/723 , G06F7/724 , G06F7/728 , G06F2207/7261 , H04L9/003 , H04L9/004 , H04L9/30 , H04L9/3066
摘要： An exponentiation method resistant against side-channel attacks and safe- error attacks. Input to the method is g in a multiplicatively written group G and a /-digit exponent d with a radix m >1 and output is z = g d -1 . ( d -1 ) is expressed as a series of (/-1 ) non-zero digits, d * 0 ... d * I-2 , in the set { m -1,...,2 m -2} and an extra digit d* I -1 that is equal to d I -1 -1, where d I -1 represents the most significant radix- m digit of d , and g d -1 is evaluated through a m -ary exponentiation algorithm on input g and ( d -1 ) represented by d * 0 ... d * I- 1 . Also provided are an apparatus and a computer program product.
摘要翻译：一种抵御侧向信道攻击和安全错误攻击的指数化方法。该方法的输入为g，乘法编写组G和a / -digit指数d，基数m> 1，输出为z = g d -1。（d-1）表示为集合{m-1，...，2m-2}中的一系列（/ -1）非零数字，d * 0 ... d * I-2和一个等于d I -1-1的额外数字d * I -1，其中d I -1表示d的最显着的rad-m数字，gd -1通过输入g上的m次乘法运算算法和由d * 0 ... d * I- 1表示的（d-1）。还提供了一种装置和计算机程序产品。

9. 发明申请

WO2010000552A1 METHOD AND APPARATUS FOR GENERATING A SIGNATURE FOR A MESSAGE AND METHOD AND APPARATUS FOR VERIFYING SUCH A SIGNATURE 审中-公开
标题翻译：用于生成消息签名的方法和装置以及用于验证这样的签名的装置
公开(公告)号：WO2010000552A1
公开(公告)日：2010-01-07
申请号：PCT/EP2009/056759
申请日：2009-06-02
申请人： THOMSON LICENSING , JOYE, Marc
发明人： JOYE, Marc
IPC分类号： H04L9/32 , H04L9/30
CPC分类号： H04L9/3249 , H04L9/302 , H04L2209/56 , H04L2209/80
摘要： A method of generating a signature σ for a message m, the method enabling online/offline signatures. Two random primes p and q are generated, with N = pq ; two random quadratic residues g and x are chosen in Z* N , and, for an integer z, h = g -Z mod N is calculated. This gives the public key { g,h,x,N } and the private key { p,q,z }. Then, an integer t and a prime e are chosen. The offline signature part y may then be calculated as: equation (I) where b is an integer bigger than 0, predetermined in the signature scheme. The online part k of the signature on message m is then calculated as k = t + mz and the signature σ on message m is generated as σ = ( k, y, e ) and returned. To verify the signature, it is checked that 1) e is an odd IE -bit integer, 2) k is an I κ-bit integer, and 3) equation (II). An advantage of the method is that it may be performed without hashing. Also provided are a signing device (210), a verification device (310), and computer program supports (260; 360).
摘要翻译：生成消息m的签名s的方法，该方法启用在线/离线签名。产生两个随机素数p和q，其中N = pq; 在Z * N中选择两个随机二次残差g和x，对于整数z，计算h = g-Z mod N。这给出公钥{g，h，x，N}和私钥{p，q，z}。然后，选择整数t和素数e。离线签名部分y然后可以被计算为：等式（I）其中b是大于0的整数，在签名方案中是预定的。然后将消息m上的签名的在线部分k计算为k = t + mz，并且生成消息m上的签名s作为s =（k，y，e）并返回。为了验证签名，检查1）e是奇数IE比特整数，2）k是I比特整数，以及3）等式（II）。该方法的优点在于可以不进行散列来执行。还提供了签名设备（210），验证设备（310）和计算机程序支持（260; 360）。

10. 发明申请

WO2009101147A1 AN APPARATUS AND A METHOD FOR CALCULATING A MULTIPLE OF A POINT ON AN ELLIPTIC CURVE 审中-公开
标题翻译：一种计算多个点的方法在一个椭圆曲线上
公开(公告)号：WO2009101147A1
公开(公告)日：2009-08-20
申请号：PCT/EP2009/051657
申请日：2009-02-12
申请人： THOMSON LICENSING , JOYE, Marc
发明人： JOYE, Marc
IPC分类号： G06F7/72
CPC分类号： H04L9/0861 , G06F7/725 , H04L9/06 , H04L9/28 , H04L9/3066
摘要： A device (100) and a method for calculating a multiple of a point on an elliptic curve from the right to the left by repeated point doubling and point addition. Each point doubling is evaluated with an extended set of coordinates and each point addition is evaluated by taking as input a restricted set of the extended set of coordinates. The at least one coordinate of the extended set that is not part of the restricted set is stored in a memory (120) between each iteration of the point doubling. This can enable speeding up the calculations as compared to prior art solutions. Also provided are a computer program and a computer program product (140).
摘要翻译：一种装置（100）和通过重复的点加倍和点加法从右向左计算椭圆曲线上的点的倍数的方法。每个点加倍用一组扩展坐标进行评估，并且通过将扩展坐标系的一组限制作为输入来评估每个点加法。扩展集合的不是受限制集合的一部分的至少一个坐标在点加倍的每次迭代之间被存储在存储器（120）中。与现有技术的解决方案相比，这可以加快计算速度。还提供了计算机程序和计算机程序产品（140）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式