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

1. 发明申请

US20190156057A1 EFFICIENTLY QUERYING DATABASES WHILE PROVIDING DIFFERENTIAL PRIVACY 审中-公开
公开(公告)号：US20190156057A1
公开(公告)日：2019-05-23
申请号：US16197813
申请日：2018-11-21
申请人： Yaacov Nissim Kobliner , Georgios Kellaris , George Kollios
发明人： Yaacov Nissim Kobliner , Georgios Kellaris , George Kollios
IPC分类号： G06F21/62 , G06F17/30
摘要： Technologies are provided for efficiently querying a database using a plurality of oblivious random-access memories (ORAMs) while providing differential privacy. Subsets of a set of database records can be stored in a plurality of ORAMs. The subsets of database records in the separate ORAMs can be concurrently accessed (for example, by a database query server). When a database query is received, a number of database records that match the query can be identified for each of the ORAMs. A differential privacy constraint can be used to determine an additional number of database records to be retrieved from each ORAM. The differential privacy constraint can specify an upper bound on the number of records to be retrieved from each ORAM to prevent (or reduce the risk of) information leakage. Once all of the identified records are retrieved from the plurality of ORAMs, the additional records can be discarded.

2. 发明授权

US07653615B2 Preserving privacy when statistically analyzing a large database 失效
标题翻译：统计分析大型数据库时保护隐私
公开(公告)号：US07653615B2
公开(公告)日：2010-01-26
申请号：US11038446
申请日：2005-01-18
申请人： Cynthia Dwork , Yaacov Nissim Kobliner
发明人： Cynthia Dwork , Yaacov Nissim Kobliner
IPC分类号： G06F17/30
CPC分类号： G06F21/6245 , G06F21/6227 , Y10S707/99933
摘要： A database has a plurality of entries and a plurality of attributes common to each entry, where each entry corresponds to an individual. A query q is received from a querying entity query q and is passed to the database, and an answer a is received in response. An amount of noise e is generated and added to the answer a to result in an obscured answer o, and the obscured answer o is returned to the querying entity. Thus, a level of protection of privacy is provided to each individual represented within the database.
摘要翻译：数据库具有多个条目和对每个条目共同的多个属性，其中每个条目对应于个人。从查询实体查询q接收到查询q，并将其传递给数据库，并且作为响应接收答复a。生成噪声量e并将其加到答案a上，导致模糊的答案o，并将隐藏的答案o返回给查询实体。因此，对数据库中表示的每个个体提供了一个隐私保护级别。

3. 发明授权

US07676454B2 Private clustering and statistical queries while analyzing a large database 有权
标题翻译：在分析大型数据库时进行私有聚类和统计查询
公开(公告)号：US07676454B2
公开(公告)日：2010-03-09
申请号：US11069116
申请日：2005-03-01
申请人： Cynthia Dwork , Frank David McSherry , Yaacov Nissim Kobliner , Avrim L. Blum
发明人： Cynthia Dwork , Frank David McSherry , Yaacov Nissim Kobliner , Avrim L. Blum
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30539 , G06F21/6227 , G06F21/6245 , Y10S707/99933
摘要： A database has a plurality of entries and a plurality of attributes common to each entry, where each entry corresponds to an individual. A query is received from a querying entity query and is passed to the database, and an answer is received in response. An amount of noise is generated and added to the answer to result in an obscured answer, and the obscured answer is returned to the querying entity. The noise is normally distributed around zero with a particular variance. The variance R may be determined in accordance with R>8 T log2(T/δ)/ε2, where T is the permitted number of queries T, δ is the utter failure probability, and ε is the largest admissible increase in confidence. Thus, a level of protection of privacy is provided to each individual represented within the database. Example noise generation techniques, systems, and methods may be used for privacy preservation in such areas as k means, principal component analysis, statistical query learning models, and perceptron algorithms.
摘要翻译：数据库具有多个条目和对每个条目共同的多个属性，其中每个条目对应于个人。从查询实体查询中接收到查询，并将其传递给数据库，并接收答复。产生噪声量并将其加到答案中，导致模糊的答案，并将隐藏的答案返回给查询实体。噪声通常分布在零附近，具有特定的差异。方差R可以根据R> 8 T log2（T /δ）/＆egr; 2确定，其中T是允许的查询数T，δ是全失效概率，＆egr; 是信心最大的允许增加。因此，对数据库中表示的每个个体提供了一个隐私保护级别。噪声生成技术，系统和方法的示例可以用于k意味着，主成分分析，统计查询学习模型和感知器算法等领域的隐私保护。

4. 发明申请

US20060200431A1 Private clustering and statistical queries while analyzing a large database 有权
标题翻译：在分析大型数据库时进行私有聚类和统计查询
公开(公告)号：US20060200431A1
公开(公告)日：2006-09-07
申请号：US11069116
申请日：2005-03-01
申请人： Cynthia Dwork , Frank McSherry , Yaacov Nissim Kobliner , Avrim Blum
发明人： Cynthia Dwork , Frank McSherry , Yaacov Nissim Kobliner , Avrim Blum
IPC分类号： G06F15/18
CPC分类号： G06F17/30539 , G06F21/6227 , G06F21/6245 , Y10S707/99933
摘要： A database has a plurality of entries and a plurality of attributes common to each entry, where each entry corresponds to an individual. A query is received from a querying entity query and is passed to the database, and an answer is received in response. An amount of noise is generated and added to the answer to result in an obscured answer, and the obscured answer is returned to the querying entity. The noise is normally distributed around zero with a particular variance. The variance R may be determined in accordance with R>8 T log2(T/δ)/ε2, where T is the permitted number of queries T, δ is the utter failure probability, and ε is the largest admissible increase in confidence. Thus, a level of protection of privacy is provided to each individual represented within the database. Example noise generation techniques, systems, and methods may be used for privacy preservation in such areas as k means, principal component analysis, statistical query learning models, and perceptron algorithms.
摘要翻译：数据库具有多个条目和对每个条目共同的多个属性，其中每个条目对应于个人。从查询实体查询中接收到查询，并将其传递给数据库，并接收答复。产生噪声量并将其加到答案中，导致模糊的答案，并将隐藏的答案返回给查询实体。噪声通常分布在零附近，具有特定的差异。方差R可以根据R> 8 T log 2（T / delta）/ε2> 2确定，其中T是允许的查询数T，delta是完全失败概率和ε是置信度最大的允许增加。因此，对数据库中表示的每个个体提供了一个隐私保护级别。噪声生成技术，系统和方法的示例可以用于k意味着，主成分分析，统计查询学习模型和感知器算法等领域的隐私保护。

5. 发明授权

US07657029B2 Systems and methods for generating random addition chains 失效
标题翻译：生成随机加成链的系统和方法
公开(公告)号：US07657029B2
公开(公告)日：2010-02-02
申请号：US11069112
申请日：2005-03-01
申请人： Anton Mityagin , Ilya Mironov , Yaacov Nissim Kobliner
发明人： Anton Mityagin , Ilya Mironov , Yaacov Nissim Kobliner
IPC分类号： H04L9/30
CPC分类号： H04L9/302 , G06F2207/7295 , H04L2209/08 , H04L2209/30 , H04L2209/38
摘要： An addition chain is first generated, and then an integer x is derived from it. Doubling and star steps may be implemented in the addition chain. This approach eliminates the computationally expensive step of generating the addition chain from an exponent, and therefore can greatly reduce the computation time of the modular exponentiation.
摘要翻译：首先生成一个加法链，然后从其中派生一个整数x。加倍链和星级步骤可能在附加链中实现。这种方法消除了从指数产生加法链的计算上昂贵的步骤，因此可以大大减少模幂运算的计算时间。

6. 发明申请

US20060198516A1 Systems and methods for generating random addition chains 失效
标题翻译：生成随机加成链的系统和方法
公开(公告)号：US20060198516A1
公开(公告)日：2006-09-07
申请号：US11069112
申请日：2005-03-01
申请人： Anton Mityagin , Ilya Mironov , Yaacov Nissim Kobliner
发明人： Anton Mityagin , Ilya Mironov , Yaacov Nissim Kobliner
IPC分类号： H04L9/30
CPC分类号： H04L9/302 , G06F2207/7295 , H04L2209/08 , H04L2209/30 , H04L2209/38
摘要： An addition chain is first generated, and then an integer x is derived from it. Doubling and star steps may be implemented in the addition chain. This approach eliminates the computationally expensive step of generating the addition chain from an exponent, and therefore can greatly reduce the computation time of the modular exponentiation.
摘要翻译：首先生成一个加法链，然后从该派生出一个整数x。加倍链和星级步骤可能在附加链中实现。这种方法消除了从指数产生加法链的计算上昂贵的步骤，因此可以大大减少模幂运算的计算时间。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式