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

51. 发明申请

WO2015101606A1 METHOD FOR PROCESSING A GENERALIZED GOLDWASSER-MICALI CIPHERTEXT, CORRESPONDING ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT 审中-公开
标题翻译：用于处理通用金手指芯片的方法，相应的电子设备和计算机程序产品
公开(公告)号：WO2015101606A1
公开(公告)日：2015-07-09
申请号：PCT/EP2014/079383
申请日：2014-12-29
申请人： THOMSON LICENSING
发明人： JOYE, Marc , LIBERT, Benoit
IPC分类号： H04L9/30
CPC分类号： H04L9/302 , H04L9/008
摘要： In one embodiment, it is proposed a method for processing a generalized Goldwasser-Micali ciphertext, said ciphertext being obtained through a use of a public key, said method being executed on an electronic device and being remarkable in that it comprises: ‐ determining at least one bit of a binary representation of a plaintext associated with said ciphertext, said at least one bit corresponding to a bit positioned at j -th position of said binary representation of said plaintext, j being an integer greater or equal to one, and position zero of said binary representation corresponding to the least significant bit of said binary representation, said determining being a function of ‐ said ciphertext, ‐ an element of said public key, ‐ a private key associated to said public key, ‐ an element defined as a function of said private key, and ‐ least significant bits of said plaintext from position zero to position j -1 in said binary representation.
摘要翻译：在一个实施例中，提出了一种用于处理广义Goldwasser-Micali密文的方法，所述密文通过使用公钥获得，所述方法在电子设备上执行，并且显着，其包括：至少确定与所述密文相关联的明文的二进制表示的一位，所述至少一个位对应于位于所述明文的所述二进制表示的第j位的位，j是大于或等于1的整数，位置零所述二进制表示对应于所述二进制表示的最低有效位，所述确定是所述密文的函数， - 所述公开密钥的元素， - 与所述公共密钥相关联的私钥， - 定义为函数的元素以及所述二进制表示中的从位置零到位置j -1的所述明文的最低有效位。

52. 发明申请

WO2014138753A2 A METHOD AND SYSTEM FOR PRIVACY-PRESERVING RECOMMENDATION TO RATING CONTRIBUTING USERS BASED ON MATRIX FACTORIZATION 审中-公开
标题翻译：一种基于矩阵分解的隐私保留建议评估贡献用户的方法和系统
公开(公告)号：WO2014138753A2
公开(公告)日：2014-09-12
申请号：PCT/US2014/036359
申请日：2014-05-01
申请人： THOMSON LICENSING
发明人： IOANNIDIS, Efstratios , WEINSBERG, Ehud , TAFT, Nina, Anne , JOYE, Marc , NIKOLAENKO, Valeria
IPC分类号： G06F21/12
CPC分类号： H04L9/3213 , G06F17/16 , G06F21/602 , G06F21/6227 , G06F21/64 , G06N5/04 , H04L9/008 , H04L9/302 , H04L9/3263 , H04L9/3273 , H04L2209/24 , H04L2209/46 , H04L2209/50 , H04N21/251 , H04N21/25891 , H04N21/44222 , H04N21/4668 , H04N21/6582
摘要： A method and a system for generating privacy-preserving recommendations commences by receiving as input a set of records including tokens and items, without learning the content of any individual record; designing and evaluating a garbled circuit based on matrix factorization on the set of records to generate recommendations in a privacy-preserving way about at least one item, without learning the content of any individual record or any information extracted from the records, including the recommendations. The system includes three parties: a plurality of users or a database representing a Source for the records; a Crypto-Service Provider which will design the garbled circuit and a Recommender System which will evaluate the circuit, such that the records and any information extracted from the records, are kept secret from parties other than their source and the recommendations are only known by the requesting party.
摘要翻译：用于生成隐私保持推荐的方法和系统开始于接收包括令牌和项目的记录集合作为输入，而不学习任何单独记录的内容; 基于对记录集合的矩阵分解设计和评估乱码电路，以至少一个项目的隐私保护方式生成推荐，而不需要学习任何单独记录的内容或从记录中提取的任何信息，包括推荐。该系统包括三方：多个用户或代表记录来源的数据库; 一个加密服务提供商将设计乱码电路和一个评估电路的推荐系统，以便记录和从记录中提取的任何信息对于其他来源以外的各方保密，并且建议仅由请求方。

53. 发明申请

WO2015191919A1 METHOD AND SYSTEM FOR PRIVACY-PRESERVING RECOMMENDATIONS 审中-公开
标题翻译：用于隐私保护建议的方法和系统
公开(公告)号：WO2015191919A1
公开(公告)日：2015-12-17
申请号：PCT/US2015/035422
申请日：2015-06-11
申请人： THOMSON LICENSING
发明人： WEINSBERG, Ehud , JOYE, Marc , IOANNIDIS, Efstratios
IPC分类号： G06F21/62 , G06Q30/06 , H04L9/00
CPC分类号： G06F21/6245 , G06Q30/0282 , G06Q30/0631 , H04L9/008
摘要： Various examples of systems and methods for providing recommendations that can be tailored to a user while preserving the privacy of the user's personal information are disclosed. In various embodiments, user information can be encrypted such that the recommendation service cannot decrypt the user information, yet the recommendation service can analyze the user information to predict user ratings for content items. The predicted user ratings can remain obscured from the recommendation service by encryption, yet can provide the basis for recommendations tailored to the user. In particular, the encrypted predicted user ratings can be sent to a third party (i.e., not the recommendation service or the user), and the third party can decrypt the predicted user ratings and determine recommendations based on the predicted user ratings.
摘要翻译：公开了用于提供可以针对用户定制的建议的系统和方法的各种示例，同时保持用户的个人信息的隐私。在各种实施例中，可以加密用户信息，使得推荐服务不能解密用户信息，但是推荐服务可以分析用户信息以预测内容项目的用户评级。预测的用户评分可以通过加密仍然可以从推荐服务中遮蔽，但可以为用户定制的推荐提供基础。特别地，加密的预测用户评级可以被发送到第三方（即，不是推荐服务或用户），并且第三方可以解密预测的用户评级并且基于预测的用户评级来确定推荐。

54. 发明申请

WO2015175365A1 METHOD AND APPARATUS FOR GENERATING SHORTER SIGNATURES ALMOST TIGHTLY RELATED TO STANDARD ASSUMPTIONS 审中-公开
标题翻译：用于产生与标准假设相关的短信签名的方法和装置
公开(公告)号：WO2015175365A1
公开(公告)日：2015-11-19
申请号：PCT/US2015/030065
申请日：2015-05-11
申请人： THOMSON LICENSING
发明人： JOYE, Marc , LIBERT, Benoit
IPC分类号： H04L9/00 , H04L9/30 , H04L9/32
CPC分类号： H04L9/008 , H04L9/3073 , H04L9/3247
摘要： The present principles use the message to be signed as a label - of the private key augmented with a QA-NIZK proof that the encrypted value is a persistent hidden secret. One-time homomorphic signatures are used to generate the signature and the public key. The private key for the one-time homomorphic signatures is included in the private key for signing the message, and the public key for the one-time homomorphic signatures is included in the public key for verifying the signature. Consequently, we obtain DLIN-based signatures comprised of only 6 group elements. The security proof uses a sequence of hybrid games, gradually moves to a game where all signatures contain an encryption of a random value while the QA-NIZK proofs are simulated proofs for false statements.
摘要翻译：本原则使用该消息作为标签，该私钥增加了QA-NIZK证明加密值是持久的隐藏秘密的标签。一次性同态特征用于生成签名和公钥。用于一次同态特征的私钥包括在用于签署消息的私钥中，并且用于一次性同态特征的公钥被包括在用于验证签名的公钥中。因此，我们获得了仅由6个组元素组成的基于DLIN的签名。安全证明使用一系列混合游戏，逐渐移动到游戏，其中所有签名都包含随机值的加密，而QA-NIZK证明是虚假陈述的模拟证明。

55. 发明申请

WO2015101533A1 MULTI-HOP PROXY RE-ENCRYPTION METHODS AND DEVICES 审中-公开
标题翻译：多重代码重新加密方法和设备
公开(公告)号：WO2015101533A1
公开(公告)日：2015-07-09
申请号：PCT/EP2014/078872
申请日：2014-12-19
申请人： THOMSON LICENSING
发明人： HEEN, Olivier , JOYE, Marc , LIBERT, Benoît
IPC分类号： H04L9/08 , H04L9/30 , H04L29/06
CPC分类号： H04L9/30 , H04L9/0825 , H04L63/0464 , H04L63/0478 , H04L2209/76
摘要： The disclosure is directed to a proxy re-encryption scheme with limited delegations. To generate a formula (I) ciphertext for a message, wherein formula (II) is an integer, a (I) ciphertext enabling formula (IV) levels of re-encryption and L-1 is a maximum number of possible re-encryption levels, a processor (112) generates, in a (I) group of prime order p, a (I) encryption key for the (I) ciphertext from a public key and a (I) generator for the (I) group; obtains a first ciphertext component by multiplying the message with a generator of a final group formula (III) of a multi-linear configuration with L levels, the generator being raised to the power of an integer exponent; obtains a second ciphertext component by taking the (I) encryption key to the power of the integer exponent; and outputs the (I) ciphertext comprising the integer (II), the first ciphertext component and the second ciphertext component. In a preferred embodiment, the processor (112) includes an indicator of a time period in the (I) ciphertext; and, if the integer (IV), obtains a third ciphertext component by taking a hash value over the time period to the power of the integer exponent and includes the third ciphertext component in the (I) ciphertext that is output. Also provided are the re-encryption and decryption counterparts.
摘要翻译：本公开涉及具有有限授权的代理重新加密方案。为了生成消息的公式（I）密文，其中公式（II）是整数，（I）密文使能公式（IV）再加密和L-1的级别是可能的重新加密级别的最大数量处理器（112）以（I）素数阶组p生成来自公钥的（I）密文和（I）组的（I）生成器的（I）加密密钥; 通过将消息与具有L个级别的多线性配置的最终组公式（III）的生成器相乘来获得第一密文分量，生成器被提升为整数指数的幂; 通过将（I）加密密钥乘以整数指数的幂来获得第二密文分量; 并输出包含整数（II），第一密文分量和第二密文分量的（I）密文。在优选实施例中，处理器（112）包括（I）密文中的时间段的指示符; 并且如果整数（IV）通过将该时间周期的散列值取为整数指数的幂来获得第三密文分量，并且包括输出的（I）密文中的第三密文分量。还提供了重新加密和解密对手。

56. 发明申请

WO2015055765A1 METHOD FOR GENERATING A QUASI-ADAPTIVE NON-INTERACTIVE ZERO-KNOWLEDGE PROOF AND CORRESPONDING ELECTRONIC DEVICE 审中-公开
标题翻译：用于生成适应性非互动零点知识证明和相应电子设备的方法
公开(公告)号：WO2015055765A1
公开(公告)日：2015-04-23
申请号：PCT/EP2014/072222
申请日：2014-10-16
申请人： THOMSON LICENSING
发明人： JOYE, Marc , LIBERT, Benoît
IPC分类号： H04L9/32
CPC分类号： H04L9/3218
摘要： In one embodiment, it is proposed a method for generating a quasi-adaptive non- interactive zero-knowledge proof, said proof assessing a membership of a first vector to a hard language, which is a subspace of G n , where G is a group and n is an integer. The method is executed by an electronic device, and is remarkable in that it comprises: generating a derived linearly homomorphic signature on a second vector, said second vector being defined as a function of said first vector, from a linearly homomorphic signatures comprised in a common reference string and a witness associated with said first vector; and generating a non-malleable element by using a public evaluation function of a smooth projective hash function, in combination with a hash function, said first vector, said witness and elements comprised in said common reference string, said proof being a combination of said derived linearly homomorphic signature and said non-malleable element.
摘要翻译：在一个实施例中，提出了一种用于生成准自适应非交互式零知识证明的方法，所述证明将第一向量的隶属度评估为硬语言，该硬语言是G n的子空间，其中G是组并且n是整数。该方法由电子设备执行，并且显着的是其包括：在第二矢量上生成衍生的线性同态特征，所述第二矢量被定义为所述第一矢量的函数，来自包含在共同的线性同态特征参考字符串和与所述第一向量相关联的证人; 以及通过使用平滑投影散列函数的公共评估函数，与散列函数，所述第一向量，所述证人和包含在所述公共参考串中的元素组合来生成非可延展元素，所述证明是所述派生的线性同态特征和所述不可塑性元素。

57. 发明申请

WO2013087629A1 GROUP ENCRYPTION METHODS AND DEVICES 审中-公开
标题翻译：集群加密方法和设备
公开(公告)号：WO2013087629A1
公开(公告)日：2013-06-20
申请号：PCT/EP2012/075091
申请日：2012-12-11
申请人： THOMSON LICENSING
发明人： EL AIMANI, Laïla , JOYE, Marc
IPC分类号： H04L9/08 , H04L9/30 , H04L9/32
CPC分类号： H04L9/0838 , H04L9/0833 , H04L9/3073 , H04L9/3218 , H04L9/3255 , H04L2209/24
摘要： The present invention improves on prior art group encryption schemes by encrypting an alias of a recipient's public key instead of the public key itself. A Group Manager publishes the encryption of the alias,the corresponding public key and a corresponding certificate on a public database DB. The alias is a resulting value of a suitably chosen function f on the public key, and can be viewed as a hash of the public key. This can allow a significant decrease in the size and cost of the resulting construction as the alias can be made smaller than the public key. In particular, there is no need to apply the second encryption scheme as many times as there are group elements in the recipient's public key.
摘要翻译：本发明通过加密接收者的公共密钥的别名而不是公钥本身来改进现有技术的组加密方案。组管理器在公共数据库DB上发布别名的加密，相应的公钥和相应的证书。别名是公钥上适当选择的函数f的结果值，并且可以被视为公共密钥的散列。这可以允许所得到的结构的尺寸和成本显着降低，因为可以使别名小于公钥。特别地，不需要像接收者的公钥中的组元素一样应用第二加密方案多次。

58. 发明申请

WO2016073059A2 PUBLIC-KEY ENCRYPTION WITH KEYWORD SEARCH 审中-公开
标题翻译：公共密钥加密与关键字搜索
公开(公告)号：WO2016073059A2
公开(公告)日：2016-05-12
申请号：PCT/US2015/045860
申请日：2015-08-19
申请人： THOMSON LICENSING
发明人： JOYE, Marc
IPC分类号： H04L9/00
CPC分类号： H04L9/302 , H04L2209/76
摘要： The present principle relate to new public-key cryptosystems with searchable encryption, in particular, public key encryption with keyword search. Public key encryption with keyword search is a form of encryption that allows searching on data that is encrypted using a public key system. Notably, these new public key cryptosystems rely on standard security assumptions. Namely, their semantic security follows from the standard quadratic residuosity assumption (in the random oracle model). The resulting ciphertexts are also much shorter than the concurrent scheme of Di Crescenzo and Saraswat.
摘要翻译：本原理涉及具有可搜索加密的新的公钥密码系统，特别是具有关键字搜索的公开密钥加密。使用关键词搜索的公钥加密是一种加密形式，允许搜索使用公共密钥系统加密的数据。值得注意的是，这些新的公钥密码系统依赖于标准的安全假设。也就是说，它们的语义安全性遵循标准二次残差假设（在随机的oracle模型中）。得到的密文也比Di Crescenzo和Saraswat的并行方案短得多。

59. 发明申请

WO2016048777A1 IDENTITY-BASED XOR HOMOMORPHIC CRYPTOSYSTEMS 审中-公开
标题翻译：基于身份的异质异质晶体
公开(公告)号：WO2016048777A1
公开(公告)日：2016-03-31
申请号：PCT/US2015/050642
申请日：2015-09-17
申请人： THOMSON LICENSING
发明人： JOYE, Marc
IPC分类号： H04L9/30 , H04L9/00
CPC分类号： H04L9/302 , H04L9/008
摘要： The present principles relate to new identity-based cryptosystems. Remarkably, the cryptosystems are equipped with an XOR homomorphism: given the encryption of two bits b and b' , anyone can derive the encryption of b ⊕ b' . The ciphertexts are twice shorter than previously known schemes. Further, they come with strong security guarantees: they are proved to be semantically secure under the standard quadratic residuosity assumption, in the random oracle model.
摘要翻译：本原理涉及新的基于身份的密码系统。值得注意的是，密码系统配备了异或同态：给定加密两位b和b'，任何人都可以导出b⊕b'的加密。密文比以前已知的方案短两倍。此外，它们具有强大的安全保证：在随机oracle模型中，它们被证明在标准二次余量假设下语义上是安全的。

60. 发明申请

WO2016044129A1 METHOD AND SYSTEM FOR PRIVACY-PRESERVING RECOMMENDATIONS 审中-公开
标题翻译：用于隐私保护建议的方法和系统
公开(公告)号：WO2016044129A1
公开(公告)日：2016-03-24
申请号：PCT/US2015/049907
申请日：2015-09-14
申请人： THOMSON LICENSING
发明人： JOYE, Marc , WEINSBERG, Ehud , IOANNIDIS, Efstratios
IPC分类号： H04N21/466
CPC分类号： H04N21/25891 , H04N21/2351 , H04N21/251 , H04N21/2668 , H04N21/435 , H04N21/4668 , H04N21/4826
摘要： Various examples of systems and methods for providing recommendations that can be tailored to a user while preserving the privacy of the user's personal information are disclosed. In various embodiments, user information can be encrypted such that the recommendation service cannot decrypt the user information, yet the recommendation service can analyze the user information to predict user ratings for content items. The predicted user ratings can remain obscured from the recommendation service by encryption, yet can provide the basis for recommendations tailored to the user. In particular, encrypted comparison information of predicted user ratings can be sent to the user, and the user can decrypt the comparison and send result information to the recommender to determine recommendations.
摘要翻译：公开了用于提供可以针对用户定制的建议的系统和方法的各种示例，同时保持用户的个人信息的隐私。在各种实施例中，可以加密用户信息，使得推荐服务不能解密用户信息，但是推荐服务可以分析用户信息以预测内容项目的用户评级。预测的用户评分可以通过加密仍然可以从推荐服务中遮蔽，但可以为用户定制的推荐提供基础。特别地，可以向用户发送预测用户等级的加密比较信息，并且用户可以解密比较并将结果信息发送给推荐者以确定推荐。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式