公开(公告)号：US08738387B2

公开(公告)日：2014-05-27

申请号：US10976558

申请日：2004-10-29

申请人： Gagan Aggarwal ,  Nina Mishra ,  Binyamin Pinkas

发明人： Gagan Aggarwal ,  Nina Mishra ,  Binyamin Pinkas

IPC分类号： G06Q10/00

CPC分类号： G06F17/30536 ,  G06Q10/04

摘要： A system and method is disclosed for determining a value of an element, having a k-th rank. The method discloses: calculating a total number of elements in a first and second dataset; prohibiting parties from accessing each other's dataset; ranking the elements within each dataset; computing a total number of elements in the datasets each having a value less than a test value; computing a total number of elements in the datasets each having a value greater than the test value; and setting the value of the element, having the k-th rank, equal to the test value, if the total number of elements having values less than the test value is ≦ the k-th rank minus one, and the total number of elements having values greater than the test value is ≦ the total number of elements minus the k-th rank. The system discloses means for practicing the method.

摘要翻译： 公开了一种用于确定具有第k等级的元素的值的系统和方法。 该方法公开：计算第一和第二数据集中的元素的总数; 禁止各方访问对方的数据集; 排列每个数据集中的元素; 计算每个具有小于测试值的值的数据集中的元素的总数; 计算每个具有大于测试值的值的数据集中的元素的总数; 如果具有小于测试值的元素的总数为＆nlE，则将具有第k个等级的元素的值设置为等于测试值; 第k个等级减去1，并且具有大于测试值的值的元素的总数为＆nlE; 元素的总数减去第k个等级。 该系统公开了实施该方法的手段。

公开(公告)号：US20060095378A1

公开(公告)日：2006-05-04

申请号：US10976558

申请日：2004-10-29

申请人： Gagan Aggarwal ,  Nina Mishra ,  Binyamin Pinkas

发明人： Gagan Aggarwal ,  Nina Mishra ,  Binyamin Pinkas

IPC分类号： G06Q99/00

CPC分类号： G06F17/30536 ,  G06Q10/04

摘要： A system and method is disclosed for determining a value of an element, having a k-th rank. The method discloses: calculating a total number of elements in a first and second dataset; prohibiting parties from accessing each other's dataset; ranking the elements within each dataset; computing a total number of elements in the datasets each having a value less than a test value; computing a total number of elements in the datasets each having a value greater than the test value; and setting the value of the element, having the k-th rank, equal to the test value, if the total number of elements having values less than the test value is ≦ the k-th rank minus one, and the total number of elements having values greater than the test value is ≦ the total number of elements minus the k-th rank. The system discloses means for practicing the method.

摘要翻译： 公开了一种用于确定具有第k等级的元素的值的系统和方法。 该方法公开：计算第一和第二数据集中的元素的总数; 禁止各方访问对方的数据集; 排列每个数据集中的元素; 计算每个具有小于测试值的值的数据集中的元素的总数; 计算每个具有大于测试值的值的数据集中的元素的总数; 并且如果具有小于测试值的值的元素的总数为<=第k个等级减去1，则将具有第k个等级的元素的值设置为等于测试值 具有大于测试值的值的元素是<=元素的总数减去第k个等级。 该系统公开了实施该方法的手段。

公开(公告)号：US20120266226A1

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

申请号：US13532223

申请日：2012-06-25

申请人： Binyamin Pinkas ,  Tomas Sander

发明人： Binyamin Pinkas ,  Tomas Sander

IPC分类号： G06F21/00

CPC分类号： H04L63/083 ,  G06F21/34 ,  G06F21/36 ,  G06F21/6218 ,  H04L63/0815 ,  H04L63/105 ,  H04L63/12 ,  H04L63/1458

摘要： Systems and methods are provided for authentication by combining a Reverse Turing Test (RTT) with password-based user authentication protocols to provide improved resistance to brute force attacks. In accordance with one embodiment of the invention, a method is provided for user authentication, the method including receiving a username/password pair associated with a user; requesting one or more responses to a first Reverse Turing Test (RTT); and granting access to the user if a valid response to the first RTT is received and the username/password pair is valid.

摘要翻译： 通过组合反向图灵测试（RTT）和基于密码的用户认证协议来提供系统和方法，以提供改进的暴力攻击抵抗能力。 根据本发明的一个实施例，提供了一种用于用户认证的方法，所述方法包括接收与用户相关联的用户名/密码对; 请求对第一次反向图灵测试（RTT）的一个或多个响应; 并且如果接收到对第一RTT的有效响应并且用户名/密码对有效，则授予对用户的访问。

公开(公告)号：US07941836B2

公开(公告)日：2011-05-10

申请号：US11781196

申请日：2007-07-20

申请人： Binyamin Pinkas ,  Tomas Sander

发明人： Binyamin Pinkas ,  Tomas Sander

IPC分类号： H04L29/06

CPC分类号： H04L63/083 ,  G06F21/34 ,  G06F21/36 ,  G06F21/6218 ,  H04L63/0815 ,  H04L63/105 ,  H04L63/12 ,  H04L63/1458

摘要： Systems and methods are provided for authentication by combining a Reverse Turing Test (RTT) with password-based user authentication protocols to provide improved resistance to brute force attacks. In accordance with one embodiment of the invention, a method is provided for user authentication, the method including receiving a username/password pair associated with a user; requesting one or more responses to a first Reverse Turing Test (RTT); and granting access to the user if a valid response to the first RTT is received and the username/password pair is valid.

摘要翻译： 通过组合反向图灵测试（RTT）和基于密码的用户认证协议来提供系统和方法，以提供改进的暴力攻击抵抗能力。 根据本发明的一个实施例，提供了一种用于用户认证的方法，所述方法包括接收与用户相关联的用户名/密码对; 请求对第一次反向图灵测试（RTT）的一个或多个响应; 并且如果接收到对第一RTT的有效响应并且用户名/密码对有效，则授予对用户的访问。

公开(公告)号：US20110214169A1

公开(公告)日：2011-09-01

申请号：US13081711

申请日：2011-04-07

申请人： Binyamin Pinkas ,  Tomas Sander

发明人： Binyamin Pinkas ,  Tomas Sander

IPC分类号： G06F21/00

CPC分类号： H04L63/083 ,  G06F21/34 ,  G06F21/36 ,  G06F21/6218 ,  H04L63/0815 ,  H04L63/105 ,  H04L63/12 ,  H04L63/1458

摘要： Systems and methods are provided for authentication by combining a Reverse Turing Test (RTT) with password-based user authentication protocols to provide improved resistance to brute force attacks. In accordance with one embodiment of the invention, a method is provided for user authentication, the method including receiving a username/password pair associated with a user; requesting one or more responses to a first Reverse Turing Test (RTT); and granting access to the user if a valid response to the first RTT is received and the username/password pair is valid.

摘要翻译： 通过组合反向图灵测试（RTT）和基于密码的用户认证协议来提供系统和方法，以提供改进的暴力攻击抵抗能力。 根据本发明的一个实施例，提供了一种用于用户认证的方法，所述方法包括接收与用户相关联的用户名/密码对; 请求对第一次反向图灵测试（RTT）的一个或多个响应; 并且如果接收到对第一RTT的有效响应并且用户名/密码对有效，则授予对用户的访问。

公开(公告)号：US20080016551A1

公开(公告)日：2008-01-17

申请号：US11781210

申请日：2007-07-20

申请人： Binyamin Pinkas ,  Tomas Sander

发明人： Binyamin Pinkas ,  Tomas Sander

IPC分类号： H04L9/32

CPC分类号： H04L63/083 ,  G06F21/34 ,  G06F21/36 ,  G06F21/6218 ,  H04L63/0815 ,  H04L63/105 ,  H04L63/12 ,  H04L63/1458

摘要： Systems and methods are provided for authentication by combining a Reverse Turing Test (RTT) with password-based user authentication protocols to provide improved resistance to brute force attacks. In accordance with one embodiment of the invention, a method is provided for user authentication, the method including receiving a username/password pair associated with a user; requesting one or more responses to a first Reverse Turing Test (RTT); and granting access to the user if a valid response to the first RTT is received and the username/password pair is valid.

公开(公告)号：US20060245587A1

公开(公告)日：2006-11-02

申请号：US11117765

申请日：2005-04-28

申请人： Binyamin Pinkas ,  Michael Freedman

发明人： Binyamin Pinkas ,  Michael Freedman

IPC分类号： H04L9/28

CPC分类号： H04L9/085

摘要： A system and method for confidentially matching information among parties are disclosed. Briefly described, one embodiment is a method comprising receiving from a first party a list of items, determining an encrypted polynomial P(y) from the first party's list of items, communicating the encrypted polynomial P(y) to a second party, receiving from the second party a list of second items, evaluating the encrypted polynomial P(y) at points defined by the second party's list of items, such that an output is determined, determining an encrypted output, the encrypted output corresponding to the output, communicating the encrypted output to the first party, decrypting the received encrypted output and determining an intersection between the first list of items and the second list of items based upon decryption of the received encrypted output.

摘要翻译： 公开了一种在各方之间保密匹配信息的系统和方法。 简要描述，一个实施例是一种方法，包括从第一方接收项目列表，从第一方的项目列表中确定加密多项式P（y），将加密多项式P（y）传送给第二方，从 所述第二方列出第二项目，在由所述第二方项目列表定义的点处评估所述加密多项式P（y），使得确定输出，确定加密输出，对应于所述输出的所述加密输出， 加密输出到第一方，解密所接收的加密输出，并且基于接收到的加密输出的解密来确定第一项目列表和第二项目列表之间的交集。

公开(公告)号：US6055508A

公开(公告)日：2000-04-25

申请号：US092069

申请日：1998-06-05

申请人： Moni Naor ,  Binyamin Pinkas

发明人： Moni Naor ,  Binyamin Pinkas

IPC分类号： H04L9/32 ,  H04L12/24 ,  H04L12/26 ,  G06F15/00 ,  H04L9/00

CPC分类号： H04L12/2602 ,  G06Q10/0639 ,  H04L41/28 ,  H04L43/00 ,  H04L9/321 ,  H04L9/3271 ,  H04L2209/42 ,  H04L2209/56 ,  H04L2209/805 ,  H04L43/022 ,  H04L43/06

摘要： A method for secure accounting and auditing of a communications network operates in an environment in which many servers serve an even larger number of clients (e.g. the web), and are required to meter the interaction between servers and clients (e.g. counting the number of clients that were served by a server). The method (metering process) is very efficient and does not require extensive usage of any new communication channels. The metering is secure against fraud attempts by servers which inflate the number of their clients and against clients that attempt to disrupt the metering process. Several secure and efficient constructions of this method are based on efficient cryptographic techniques, are also very accurate, and preserver the privacy of the clients.

摘要翻译： 用于通信网络的安全计费和审计的方法在许多服务器服务于更多数量的客户端（例如，网络）的环境中运行，并且需要对服务器和客户端之间的交互进行计量（例如，计数客户端的数量 由服务器服务）。 该方法（计量过程）非常有效，并且不需要广泛使用任何新的通信信道。 计量是安全的，防止服务器的欺诈尝试，这些服务器使客户数量和客户端的数量膨胀，这些客户端试图中断计量过程。 这种方法的几个安全有效的结构是基于有效的加密技术，也非常准确，并且保护了客户的隐私。

公开(公告)号：US09356929B2

公开(公告)日：2016-05-31

申请号：US13451369

申请日：2012-04-19

申请人： Binyamin Pinkas ,  Stuart A. Haber ,  Robert E. Tarjan ,  Tomas Sander

发明人： Binyamin Pinkas ,  Stuart A. Haber ,  Robert E. Tarjan ,  Tomas Sander

IPC分类号： H04L29/06 ,  G06F21/36 ,  G06Q20/34 ,  G06Q20/40 ,  G07C9/00 ,  G07F7/10

CPC分类号： H04L63/083 ,  G06F21/36 ,  G06Q20/341 ,  G06Q20/4097 ,  G07C9/00142 ,  G07F7/10 ,  G07F7/1008 ,  G07F7/1025 ,  G09C5/00 ,  H04L9/3226 ,  H04L9/3271 ,  H04L63/10 ,  H04W12/06 ,  H04W12/08

摘要： A method of establishing a secure channel between a human user and a computer application is described. A secret unique identifier (“PIN”) is shared between a user and an application. When the user makes a request that involves utilizing the PIN for authentication purposes, the application renders a randomly selected identifier. The randomly selected identifier is in a format that is recognizable to a human but is not readily recognizable by an automated agent. The randomly selected identifier is then presented to the human user. The user identifies the relationship between the randomly selected identifier and the PIN. If the user's input reflects the fact that the user knows the PIN, then the user is authenticated.

摘要翻译： 描述了在人类用户和计算机应用之间建立安全信道的方法。 秘密唯一标识符（“PIN”）在用户和应用程序之间共享。 当用户进行涉及利用PIN进行认证的请求时，应用程序呈现随机选择的标识符。 随机选择的标识符是人可识别的格式，但是不能被自动代理人容易地识别。 然后将随机选择的标识符呈现给人类用户。 用户识别随机选择的标识符和PIN之间的关系。 如果用户的输入反映了用户知道PIN的事实，则用户被认证。

公开(公告)号：US20110026781A1

公开(公告)日：2011-02-03

申请号：US12828906

申请日：2010-07-01

申请人： Margarita Osadchy ,  Binyamin Pinkas ,  Ayman Jarrous ,  Boaz Moskovich

发明人： Margarita Osadchy ,  Binyamin Pinkas ,  Ayman Jarrous ,  Boaz Moskovich

IPC分类号： G06K9/00

CPC分类号： G06K9/00221 ,  H04L9/008

摘要： A method for privacy-retaining face identification comprising dividing at least one input face into a first set of patches, providing an assortment of patch profiles for each patch in the first set of patches, each patch profile in the assortment being associated with a unique index thereby to define an assortment of unique indices, for each individual patch in the input face, finding at least one patch profile within the assortment of patch profiles which most resembles the individual patch, thereby to define a first set of indices from among the assortment of unique indices whose corresponding patch profiles most resemble the input face's patches respectively, and using a privacy preserving computation to generate a physical output indicative of a comparison of the input face and at least one target face by comparing first and second functions of the first set of indices and of a second set of indices respectively, the second set of indices corresponding to patch profiles which most resemble a second set of patches into which the target face has been divided.

摘要翻译： 一种用于隐私保持面部识别的方法，包括将至少一个输入面分成第一组补片，为第一组补丁中的每个补丁提供各种补丁简档，每个补丁简档在分类中与唯一索引相关联 从而为输入面中的每个单独的贴片定义各种独特的索引，在最类似于单个贴片的贴片配置文件的分类中找到至少一个贴片配置文件，从而定义第一组索引， 其对应的补丁配置文件最相似于输入面的补丁的唯一索引，并且使用隐私保留计算来生成指示输入面和至少一个目标面的比较的物理输出，比较第一组的第一和第二功能 索引和第二组索引，第二组索引对应于最多的补丁简档 类似于目标面已被划分到的第二组补丁。