Patents by Inventor Yael Gertner

Yael Gertner 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: 11171974
    Abstract: An architecture is provided for a widely distributed security system (SDI-SCAM) that protects computers at individual client locations, but which constantly pools and analyzes information gathered from machines across a network in order to quickly detect patterns consistent with intrusion or attack, singular or coordinated. When a novel method of attack has been detected, the system distributes warnings and potential countermeasures to each individual machine on the network. Such a warning may potentially include a probability distribution of the likelihood of an intrusion or attack as well as the relative probabilistic likelihood that such potential intrusion possesses certain characteristics or typologies or even strategic objectives in order to best recommend and/or distribute to each machine the most befitting countermeasure(s) given all presently known particular data and associated predicted probabilistic information regarding the prospective intrusion or attack.
    Type: Grant
    Filed: November 21, 2016
    Date of Patent: November 9, 2021
    Assignee: Inventship LLC
    Inventors: Yael Gertner, Frederick S. M. Herz, Walter Paul Labys
  • Publication number: 20170078317
    Abstract: An architecture is provided for a widely distributed security system (SDI-SCAM) that protects computers at individual client locations, but which constantly pools and analyzes information gathered from machines across a network in order to quickly detect patterns consistent with intrusion or attack, singular or coordinated. When a novel method of attack has been detected, the system distributes warnings and potential countermeasures to each individual machine on the network. Such a warning may potentially include a probability distribution of the likelihood of an intrusion or attack as well as the relative probabilistic likelihood that such potential intrusion possesses certain characteristics or typologies or even strategic objectives in order to best recommend and/or distribute to each machine the most befitting countermeasure(s) given all presently known particular data and associated predicted probabilistic information regarding the prospective intrusion or attack.
    Type: Application
    Filed: November 21, 2016
    Publication date: March 16, 2017
    Inventors: Yael Gertner, Frederick S.M. Herz, Walter Paul Labys
  • Patent number: 9503470
    Abstract: An architecture is provided for a widely distributed security system (SDI-SCAM) that protects computers at individual client locations, but which constantly pools and analyzes information gathered from machines across a network in order to quickly detect patterns consistent with intrusion or attack, singular or coordinated. When a novel method of attack has been detected, the system distributes warnings and potential countermeasures to each individual machine on the network. Such a warning may potentially include a probability distribution of the likelihood of an intrusion or attack as well as the relative probabilistic likelihood that such potential intrusion possesses certain characteristics or typologies or even strategic objectives in order to best recommend and/or distribute to each machine the most befitting countermeasure(s) given all presently known particular data and associated predicted probabilistic information regarding the prospective intrusion or attack.
    Type: Grant
    Filed: October 1, 2013
    Date of Patent: November 22, 2016
    Assignee: Fred Herz Patents, LLC
    Inventors: Yael Gertner, Frederick S. M. Herz, Walter Paul Labys
  • Publication number: 20140237599
    Abstract: An architecture is provided for a widely distributed security system (SDI-SCAM) that protects computers at individual client locations, but which constantly pools and analyzes information gathered from machines across a network in order to quickly detect patterns consistent with intrusion or attack, singular or coordinated. When a novel method of attack has been detected, the system distributes warnings and potential countermeasures to each individual machine on the network. Such a warning may potentially include a probability distribution of the likelihood of an intrusion or attack as well as the relative probabilistic likelihood that such potential intrusion possesses certain characteristics or typologies or even strategic objectives in order to best recommend and/or distribute to each machine the most befitting countermeasure(s) given all presently known particular data and associated predicted probabilistic information regarding the prospective intrusion or attack.
    Type: Application
    Filed: October 1, 2013
    Publication date: August 21, 2014
    Inventors: Yael Gertner, Frederick S.M. Herz, Walter Paul Labys
  • Publication number: 20140095417
    Abstract: A computer system is adapted to predict the likelihood, temporal (or developmental) state, possible location(s), rate of spread or “infectiousness”, etc. of a potential epidemic. A wide and diverse range of inputs and associated parameters are inputted into the system some of which may be statistically correlatable with certain hidden states including those which are temporally oriented disease stages of progression as well as other types of attributes. A Dynamic Bayesian Belief Network or other adaptive or machine learning method is used for the probabilistic analysis. The system statistically analyzes and reanalyzes the totality of all recently updated information (and within the context of all past information), as can efficiently be modeled by the Dynamic Bayesian Belief Network or other adaptive or machine learning method to provide updated predictions and to suggest a recommended reactive protocol to an epidemic.
    Type: Application
    Filed: October 1, 2013
    Publication date: April 3, 2014
    Inventors: Frederick S.M. Herz, Walter Paul Labys, Bhupinder Madan, Yael Gertner, Sampath Kannan
  • Patent number: 7454020
    Abstract: An encryption scheme that uses steganography includes an encryption algorithm that encrypts messages by embedding them in a data stream in such a way that an adversary cannot get information about the messages. Since the embedding is the only computation required, this scheme is optimal in computational efficiency. However, since the size of the data stream is large, this scheme is most beneficial when the cost of bandwidth is less expensive than the cost of computation. The scheme embeds the message as specified by a pseudo random generator.
    Type: Grant
    Filed: April 22, 2003
    Date of Patent: November 18, 2008
    Inventors: Frederick S. M. Herz, Yael Gertner, Craig Martell, Sampath Kannan
  • Patent number: 7350069
    Abstract: We propose a multi user information theoretically secure scheme. Our scheme allows any two parties in a multi user system to exchange messages securely using encryption, and to sign messages. Our scheme achieves a significant saving in the number of total keys in the system and in the keys each user must store. The encryption, and signing algorithms proposed in the scheme are as efficient as possible. Our scheme is designed so that it is possible to easily and efficiently revoke and add membership of new users into the system. It is also designed so that authentication and security against man in the middle attacks can be added at low cost. In addition, we introduce a novel and efficient way to use steganography for key replenishment.
    Type: Grant
    Filed: April 18, 2003
    Date of Patent: March 25, 2008
    Inventors: Frederick S. M. Herz, Yael Gertner, Craig H. Martell, Sampath Kannan
  • Publication number: 20060059347
    Abstract: We propose a multi user information theoretically secure scheme. Our scheme allows any two parties in a multi user system to exchange messages securely using encryption, and to sign messages. Our scheme achieves a significant saving in the number of total keys in the system and in the keys each user must store. The encryption, and signing algorithms proposed in the scheme are as efficient as possible. Our scheme is designed so that it is possible to easily and efficiently revoke and add membership of new users into the system. It is also designed so that authentication and security against man in the middle attacks can be added at low cost. In addition, we introduce a novel and efficient way to use steganography for key replenishment.
    Type: Application
    Filed: April 18, 2003
    Publication date: March 16, 2006
    Inventors: Frederick Herz, Yael Gertner, Craig Martell, Sampath Kannan
  • Publication number: 20060013390
    Abstract: We propose an encryption scheme which uses steganography. The encryption algorithm encrypts messages by embedding them in a data stream in such a way that an adversary cannot get information about the messages. Since the embedding is the only computation requires this scheme is optimal in computational efficiency. However, since the size of the data stream is large, this scheme is most beneficial when the cost of bandwidth is less expensive than the cost of computation. The scheme embeds the message as specified by a pseudo random generator. Therefore, the scheme's security is based on a new weak assumption base on the pseudo random generator which we introduce.
    Type: Application
    Filed: April 22, 2003
    Publication date: January 19, 2006
    Inventors: Frederick Herz, Yael Gertner, Craig Martell, Sampath Kannan