Patents by Inventor Vladimir Shpilrain

Vladimir Shpilrain 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: 10396976
    Abstract: A system for producing a public ring that is fully homomorphically encrypted. The system comprises a processor which generates a first presentation G of a ring, wherein G=x, y|x2=0, y2=0, xy+(p+1)yx=1, where x and y are generators and p is a first private prime number. The system further generates a second presentation H of the ring. H is defined as follows: H=x, y, t|x2=0, y2=0, t=m1yx, xy+m2yx+t=1. In addition, m1 and m2 are positive integers and p+1=m1+m2, wherein t is a generator and the first presentation G and the second presentation H are isomorphic. The system further produces a public ring ? that is fully homomorphically encrypted, where: H ^ = ? x , y , t ? N · 1 = 1 , x 2 = 1 , y 2 = 0 , xyx = x , yxy = y , tx = 0 , yt = 0 , t 2 = t + m 2 2 - m 2 m 1 ? tyx ? , N=pq and further, q is a second private prime number, and the public ring ? is further, publically available. A corresponding method is also disclosed.
    Type: Grant
    Filed: February 14, 2018
    Date of Patent: August 27, 2019
    Assignee: Research Foundation of The City University of New York
    Inventors: Delaram Kahrobaei, Ha T. Lam, Vladimir Shpilrain
  • Publication number: 20180183572
    Abstract: A system for producing a public ring that is fully homomorphically encrypted. The system comprises a processor which generates a first presentation G of a ring, wherein G=x, y|x2=0, y2=0, xy+(p+1)yx=1, where x and y are generators and p is a first private prime number. The system further generates a second presentation H of the ring. H is defined as follows: H=x, y, t|x2=0, y2=0, t=m1yx, xy+m2yx+t=1. In addition, m1 and m2 are positive integers and p+1=m1+m2, wherein t is a generator and the first presentation G and the second presentation H are isomorphic. The system further produces a public ring ? that is fully homomorphically encrypted, where: H ^ = ? x , y , t ? N · 1 = 1 , x 2 = 1 , y 2 = 0 , xyx = x , yxy = y , tx = 0 , yt = 0 , t 2 = t + m 2 2 - m 2 m 1 ? tyx ? , N=pq and further, q is a second private prime number, and the public ring ? is further, publically available. A corresponding method is also disclosed.
    Type: Application
    Filed: February 14, 2018
    Publication date: June 28, 2018
    Inventors: Delaram Kahrobaei, Ha T. Lam, Vladimir Shpilrain
  • Patent number: 9942031
    Abstract: A system for producing a public ring that is fully homomorphically encrypted. The system comprises a processor which generates a first presentation G of a ring, where G=x,y|x2=0,y2=0,xy+(p+1)yx=1, where x and y are generators and p is a first private prime number. The system further generates a second presentation H of the ring. H is defined as follows: H=x,y,t|x2=0,y2=0,t=m1yx,xy+m2yx+t=1. In addition, m1 and m2 are positive integers and p+1=m1+m2, wherein t is a generator and the first presentation G and the second presentation H are isomorphic. The system further produces a public ring ? that is fully homomorphically encrypted, where: H ^ = ? x , y , t ? N · 1 = 1 , x 2 = 1 , y 2 = 0 , xyx = x , yxy = y , tx = 0 , yt = 0 , t 2 = t + m 2 2 - m 2 m 1 ? tyx ? , N=pq and further, q is a second private prime number, and the public ring ? is further, publically available. A corresponding method is also disclosed.
    Type: Grant
    Filed: August 25, 2015
    Date of Patent: April 10, 2018
    Assignee: Research Foundation of the City University of New York
    Inventors: Delaram Kahrobaei, Ha T. Lam, Vladimir Shpilrain
  • Patent number: 9825926
    Abstract: A method for delegating a computational burden from a computationally limited party to a computationally superior party is disclosed. Computations that can be delegated include inversion and exponentiation modulo any number m. This can be then used for sending encrypted messages by a computationally limited party in a standard cryptographic framework, such as RSA. Security of delegating computation is not based on any computational hardness assumptions, but instead on the presence of numerous decoys of the actual secrets.
    Type: Grant
    Filed: July 9, 2015
    Date of Patent: November 21, 2017
    Assignee: Research Foundation of the City University of New York
    Inventors: Delaram Kahrobaei, Bren Cavallo, Vladimir Shpilrain
  • Publication number: 20170063526
    Abstract: A system for producing a public ring that is fully homomorphically encrypted. The system comprises a processor which generates a first presentation G of a ring, where G=x, y|x2=0, y2=0, xy+(p+1)yx=1, where x and y are generators and p is a first private prime number. The system further generates a second presentation H of the ring. H is defined as follows: H=x, y,t|x2=0, y2=0, t=m1yx, xy+m2yx+t=1. In addition, m1 and m2 are positive integers and p+1=m1+m2, wherein t is a generator and the first presentation G and the second presentation H are isomorphic. The system further produces a public ring ? that is fully homomorphically encrypted, where: H ^ = ? x , y , t ? N · 1 = 1 , x 2 = 1 , y 2 = 0 , xyx = x , yxy = y , tx = 0 , yt = 0 , t 2 = t + m 2 2 - m 2 m 1 ? tyx ? , N=pq and further, q is a second private prime number, and the public ring ? is further, publically available. A corresponding method is also disclosed.
    Type: Application
    Filed: August 25, 2015
    Publication date: March 2, 2017
    Inventors: Delaram Kahrobaei, Ha T. Lam, Vladimir Shpilrain
  • Publication number: 20160057119
    Abstract: A method for delegating a computational burden from a computationally limited party to a computationally superior party is disclosed. Computations that can be delegated include inversion and exponentiation modulo any number m. This can be then used for sending encrypted messages by a computationally limited party in a standard cryptographic framework, such as RSA. Security of delegating computation is not based on any computational hardness assumptions, but instead on the presence of numerous decoys of the actual secrets.
    Type: Application
    Filed: July 9, 2015
    Publication date: February 25, 2016
    Inventors: Delaram Kahrobaei, Bren Cavallo, Vladimir Shpilrain