Patents by Inventor Ariel Elbaz

Ariel Elbaz has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7685115
    Abstract: A computer implemented method classifies securely a private query sample using exact k-nn classification. A secure dot product protocol is applied to determine securely distances between a private query sample and a plurality of private labeled samples. A secure k-rank protocol is applied to the distances to determine a nearest distance of a kth nearest labeled sample having a particular label. Then, a secure Parzen protocol is applied to the nearest distance to label the private query sample according to the particular label.
    Type: Grant
    Filed: July 21, 2006
    Date of Patent: March 23, 2010
    Assignee: Mitsubishi Electronic Research Laboratories, Inc.
    Inventors: Shmuel Avidan, Ariel Elbaz
  • Patent number: 7657028
    Abstract: A method for securely classifying private data x of a first party Alice using a classifier H(x) of a second party Bob. The classifier is H ? ( x ) = sign ? ? ( ? n = 1 N ? h n ? ( x ) ) , where h n ? ( x ) = { ? n x T ? y n > ? n ? n otherwise , ? n , ? n and ?n are scalar values and yn is a vector storing parameters of the classifier. Bob generates a set of N random numbers, S1, . . . , SN, such that s = ? n = 1 N ? s n , for each n=1, . . . , N, the following substeps are performed: applying a secure dot product to xTyn to obtain an for Alice and bn for Bob; applying a secure millionaire protocol to determine whether an is larger than ?n?bn, and returning a result of an+Sn, or ?n+Sn; accumulating, by Alice, the result in cn.
    Type: Grant
    Filed: October 7, 2005
    Date of Patent: February 2, 2010
    Assignee: Mitsubishi Electric Research Laboratories, Inc.
    Inventors: Shmuel Avidan, Ariel Elbaz
  • Publication number: 20080021899
    Abstract: A computer implemented method classifies securely a private query sample using exact k-nn classification. A secure dot product protocol is applied to determine securely distances between a private query sample and a plurality of private labeled samples. A secure k-rank protocol is applied to the distances to determine a nearest distance of a kth nearest labeled sample having a particular label. Then, a secure Parzen protocol is applied to the nearest distance to label the private query sample according to the particular label.
    Type: Application
    Filed: July 21, 2006
    Publication date: January 24, 2008
    Inventors: Shmuel Avidan, Ariel Elbaz
  • Publication number: 20070081664
    Abstract: A method for securely classifying private data x of a first party Alice using a classifier H(x) of a second party Bob. The classifier is H ? ( x ) = sign ? ? ? ( ? n = 1 N ? h n ? ( x ) ) , where h n ? ( x ) = { ? n x T ? y n > ? n ? n otherwise , ? n , ? n and ?n are scalar values and yn is a vector storing parameters of the classifier. Bob generates a set of N random numbers, S1, . . . , SN, such that s = ? n = 1 N ? s n , for each n=1, . . . , N, the following substeps are performed: applying a secure dot product to xTyn to obtain an for Alice and bn for Bob; applying a secure millionaire protocol to determine whether an is larger than ?n?bn, and returning a result of ?n+Sn, or ?n+Sn; accumulating, by Alice, the result in cn.
    Type: Application
    Filed: October 7, 2005
    Publication date: April 12, 2007
    Inventors: Shmuel Avidan, Ariel Elbaz