公开(公告)号：US20090006855A1

公开(公告)日：2009-01-01

申请号：US11718806

申请日：2005-11-09

Applicant: Pim Theo Tuyls ,  Evgeny Verbitskiy ,  Berry Schoenmakers ,  Marten Erik Van Dijk

Inventor： Pim Theo Tuyls ,  Evgeny Verbitskiy ,  Berry Schoenmakers ,  Marten Erik Van Dijk

IPC: H04L9/32

CPC classification number: H04L9/3231 ,  H04L9/008 ,  H04L9/3218 ,  H04L2209/46 ,  H04L2209/805

Abstract: The present invention relates to a method and a system of securely computing a measure of similarity for at least two sets of data. A basic idea of the present invention is to securely compare two sets of encrypted data to determine whether the two sets of data resemble each other to a sufficient extent. If the measure of similarity complies with predetermined criteria, the two sets of data from which the encrypted sets of data originate are considered to be identical.

Abstract translation: 本发明涉及一种安全地计算至少两组数据的相似性度量的方法和系统。 本发明的基本思想是安全地比较两组加密数据，以确定这两组数据是否足够相似。 如果相似性度量符合预定标准，则认为加密的数据集来源的两组数据是相同的。

公开(公告)号：US09077509B2

公开(公告)日：2015-07-07

申请号：US12096802

申请日：2006-12-07

Applicant: Pim Theo Tuyls ,  Berry Schoenmakers

Inventor： Pim Theo Tuyls ,  Berry Schoenmakers

IPC: H04K1/00 ,  H04L9/00 ,  H04L9/32

CPC classification number: H04L9/0869 ,  G06F7/588 ,  H04L9/008 ,  H04L9/3231 ,  H04L2209/24 ,  H04L2209/46 ,  H04L2209/805

Abstract: The present invention relates to a method of converting an encrypted data set into an encryption of individual bits representing the data set. Further, the invention relates to a system for converting an encrypted data set into an encryption of individual bits representing the data set. A basic idea of the present invention is to provide a protocol in which it is possible to divide an encryption of a data set in the form of e.g. a biometric feature, such as a number x, where xε{0, 1, . . . , n−1}, into an encryption of respective bits x0, x1, . . . , xt-1 forming the number x, where t is the number of bits of the number n−1, without leaking any information about x or its bits x0, x1, . . . , xt-1 Hence, the present invention enables splitting of the encryption [[x]] into the respective encrypted bits [[x0]], [[x1]], . . . , [[xt-1]] forming the encrypted number x=ΣI=1n xi 2i.

Abstract translation: 本发明涉及一种将加密数据集转换为表示数据集的各个比特的加密的方法。 此外，本发明涉及一种用于将加密数据集转换为表示数据集的各个比特的加密的系统。 本发明的基本思想是提供一种协议，其中可以将数据集的加密划分为例如数据集的形式。 一个生物特征，例如数字x，其中x＆egr; {0,1，...， 。 。 ，n-1}转换成相应位x0，x1，...的加密。 。 。 ，xt-1形成数字x，其中t是数字n-1的位数，而不泄漏关于x或其位x0，x1的任何信息。 。 。 ，xt-1因此，本发明能够将加密[[x]]分割成各自的加密比特[[x0]] [[x1]]。 。 。 ，[[xt-1]]形成加密数x =＆Sgr; I = 1n xi 2i。

公开(公告)号：US08281148B2

公开(公告)日：2012-10-02

申请号：US11718806

申请日：2005-11-09

Applicant: Pim Theo Tuyls ,  Evgeny Verbitskiy ,  Berry Schoenmakers ,  Marten Erik Van Dijk

Inventor： Pim Theo Tuyls ,  Evgeny Verbitskiy ,  Berry Schoenmakers ,  Marten Erik Van Dijk

IPC: H04L29/06

CPC classification number: H04L9/3231 ,  H04L9/008 ,  H04L9/3218 ,  H04L2209/46 ,  H04L2209/805

Abstract: The present invention relates to a method and a system of securely computing a measure of similarity for at least two sets of data. A basic idea of the present invention is to securely compare two sets of encrypted data to determine whether the two sets of data resemble each other to a sufficient extent. If the measure of similarity complies with predetermined criteria, the two sets of data from which the encrypted sets of data originate are considered to be identical.

Abstract translation: 本发明涉及一种安全地计算至少两组数据的相似性度量的方法和系统。 本发明的基本思想是安全地比较两组加密数据，以确定这两组数据是否足够相似。 如果相似性度量符合预定标准，则认为加密的数据集来源的两组数据是相同的。

公开(公告)号：US20080304657A1

公开(公告)日：2008-12-11

申请号：US12096802

申请日：2006-12-07

Applicant: Pim Theo Tuyls ,  Berry Schoenmakers

Inventor： Pim Theo Tuyls ,  Berry Schoenmakers

IPC: H04L9/28

CPC classification number: H04L9/0869 ,  G06F7/588 ,  H04L9/008 ,  H04L9/3231 ,  H04L2209/24 ,  H04L2209/46 ,  H04L2209/805

Abstract: The present invention relates to a method of converting an encrypted data set into an encryption of individual bits representing the data set. Further, the invention relates to a system for converting an encrypted data set into an encryption of individual bits representing the data set. A basic idea of the present invention is to provide a protocol in which it is possible to divide an encryption of a data set in the form of e.g. a biometric feature, such as a number x, where xε{0, 1, . . . , n−1}, into an encryption of respective bits x0, x1, . . . , xt−1 forming the number x, where t is the number of bits of the number n−1, without leaking any information about x or its bits x0, x1, . . . , xt−1 Hence, the present invention enables splitting of the encryption [[x]] into the respective encrypted bits [[x0]], [[x1]], . . . , [[xt−1]] forming the encrypted number x=ΣI=1n xi 2i.

Abstract translation: 本发明涉及一种将加密数据集转换为表示数据集的各个比特的加密的方法。 此外，本发明涉及一种用于将加密数据集转换为表示数据集的各个比特的加密的系统。 本发明的基本思想是提供一种协议，其中可以将数据集的加密划分为例如数据集的形式。 生物特征，例如数字x，其中xepsilon {0,1，...， 。 。 ，n-1}转换成相应位x0，x1，...的加密。 。 。 ，xt-1形成数字x，其中t是数字n-1的位数，而不泄漏关于x或其位x0，x1的任何信息。 。 。 ，xt-1因此，本发明能够将加密[[x]]分割成各自的加密比特[[x0]] [[x1]]。 。 。 ，[[xt-1]]形成加密数x = SigmaI = 1n xi 2i。

公开(公告)号：US20070282870A1

公开(公告)日：2007-12-06

申请号：US11569690

申请日：2005-04-29

Applicant: Willem Jonker ,  Richard Brinkman ,  Jeroen Doumen ,  Berry Schoenmakers

Inventor： Willem Jonker ,  Richard Brinkman ,  Jeroen Doumen ,  Berry Schoenmakers

IPC: G06F17/30

CPC classification number: G06F21/6245 ,  G06F21/6227 ,  H04L9/32 ,  H04L2209/60

Abstract: Method of and device for querying of protected data structured in the form of a tree. A corresponding tree of node polynomials is constructed such that each node polynomial evaluates to zero for an input equal to an identifier assigned to a node name occurring in a branch of the data tree starting with the node in question. A tree of blinding polynomials and a tree of difference polynomials are constructed such that each polynomial in the tree of node polynomials equals the sum of the corresponding polynomial in the tree of blinding polynomials and the corresponding polynomial in the tree of difference polynomials. The blinding tree is given to a client, the difference tree to a server. By combining the outcomes of the evaluations of the client and the server, it is possible to identify nodes that match a given query.

Abstract translation: 用于查询以树形式构成的受保护数据的方法和设备。 构造相应的节点多项式树，使得每个节点多项式对于等于分配给在所讨论的节点开始的数据树的分支中出现的节点名称的标识的输入，求值为零。 构造一个多项式的树和一个差分多项式树，使得节点多项式树中的每个多项式等于多项式树中的相应多项式和差分多项式树中相应的多项式的和。 给一个客户端提供了一个盲目的树，一个与服务器不同的树。 通过结合客户端和服务器的评估结果，可以识别与给定查询匹配的节点。

公开(公告)号：US20070116283A1

公开(公告)日：2007-05-24

申请号：US10577757

申请日：2004-11-02

Applicant: Pim Tuyls ,  Berry Schoenmakers

Inventor： Pim Tuyls ,  Berry Schoenmakers

IPC: H04K1/00

CPC classification number: H04L9/008 ,  H04L9/0844 ,  H04L9/3013 ,  H04L9/3218 ,  H04L2209/46

Abstract: The invention introduces, in the framework of secure multiparty computation based on homomorphic threshold cryptosystems, a protocol and a special type of multiplication gate that can be realized in a surprisingly simple and efficient way using just standard homomorphic threshold ElGamal encryption. As addition gates are essentially for free, the conditional gate not only allows for building a circuit for any function, but actually yields efficient circuits for a wide range of tasks.

Abstract translation: 本发明在基于同态阈值密码系统的安全多方计算的框架内引入了一种协议和特殊类型的乘法门，可以以令人惊讶的简单有效的方式使用标准同态阈值ElGamal加密来实现。 由于加法门基本上是免费的，条件门不仅允许构建用于任何功能的电路，而且实际上为广泛的任务产生有效的电路。

公开(公告)号：US5956400A

公开(公告)日：1999-09-21

申请号：US684263

申请日：1996-07-19

Applicant: David Chaum ,  Niels T. Ferguson ,  Berry Schoenmakers ,  Erik W. Voskuil

Inventor： David Chaum ,  Niels T. Ferguson ,  Berry Schoenmakers ,  Erik W. Voskuil

IPC: H04L29/06 ,  H04L9/00 ,  G06F17/30 ,  H04L9/30

CPC classification number: H04L63/0407 ,  H04L29/06 ,  H04L63/0428 ,  H04L63/0442 ,  Y10S707/99931 ,  Y10S707/99939

Abstract: An information storage system includes one or more information update terminals, a mapper, one or more partial-databases, and one or more query terminals, exchanging messages over a set of communication channels. An identifier-mapping mechanism provides (to an update terminal) a method for delegating control over retrieval of the data stored at the partial-databases to one or more mappers, typically operated by one or more trusted third parties. Update terminals supply information, that is stored in fragmented form by the partial-databases. Data-fragment identifiers and pseudonyms are introduced, preventing unauthorized de-fragmentation of information--thus providing compliance to privacy legislation--while at the same time allowing query terminals to retrieve (part of) the stored data or learn properties of the stored data. The mapper is necessarily involved in both operations, allowing data access policies to be enforced and potential abuse of stored information to be reduced. Introduction of multiple mappers acts to distribute information retrieval control among multiple trusted third parties. Introducing so-called `groupers` increases the efficiency of data retrieval for a common set of queries and further reduces potential abuse of information.

Abstract translation: 信息存储系统包括一个或多个信息更新终端，映射器，一个或多个部分数据库和一个或多个查询终端，通过一组通信信道交换消息。 标识符映射机制提供（对更新终端）用于委托对存储在部分数据库中的数据的检索的控制的方法，所述方法通常由一个或多个受信任的第三方操作的一个或多个映射器。 更新终端提供的信息，以部分数据库的分段形式存储。 引入数据片段标识符和假名，防止未经授权的信息拆散，从而提供符合隐私权立法的同时允许查询终端检索（部分）存储的数据或学习存储数据的属性。 映射器必然涉及两个操作，允许执行数据访问策略，并减少存储信息的潜在滥用。 介绍多个映射器的作用是在多个受信任的第三方之间分发信息检索控制。 引入所谓的“石斑鱼”可以提高一组通用查询的数据检索效率，进一步减少潜在的信息滥用。