Edward M Barton

US Patent:

8621227, Dec 31, 2013

Filed:

Dec 28, 2010

Appl. No.:

12/980218

Inventors:

Edward M. Barton - Dublin CA, US
Len L. Mizrah - San Carlos CA, US

Assignee:

Authernative, Inc. - Redwood City CA

International Classification:

H04L 9/32
H04K 1/00
H04L 9/00

US Classification:

713181, 380 28, 380 44, 380277

Abstract:

Two parties can establish a cryptographic key using a matrix based key exchange protocol, for secure communications without any prior distribution of secret keys or other secret data, and without revealing said key to any third party who may have access to all of the transmissions between them. A common matrix M, shared in advance, is multiplied by a random matrix K on the sending side, and a different random matrix N on the receiving side. The matrix product KM is sent from the sending side to the receiving side, and the matrix product MN is sent from the receiving side to the sending side. Both sides produce the common matrix product KMN, and use it for producing a symmetric key for encrypted communications.

US Patent:

20050165867, Jul 28, 2005

Filed:

Jan 23, 2004

Appl. No.:

10/764069

Inventors:

Edward Barton - Pleasanton CA, US
Avishai Hochberg - San Jose CA, US
James Smith - Redwood City CA, US
Peter Symonds - Morgan Hill CA, US

International Classification:

G06F012/00

US Classification:

707204000

Abstract:

One aspect of the invention is a method for ensuring consistency of a group, which for example, includes receiving a first list that identifies objects in the group, and gathering for at least one attribute, the value of the attribute for each object in the first list. The first list, and the attribute values gathered in the gathering operation, are stored to create a first snapshot. This example also includes receiving a second list that identifies objects that are in the group after at least part of a task is performed, and the value after at least part of the task is performed of the at least one attribute for each object identified in the second list. The second list and the received attribute values are stored to create a second snapshot, which is compared with the first snapshot.

US Patent:

20060123342, Jun 8, 2006

Filed:

Dec 8, 2004

Appl. No.:

11/007536

Inventors:

Edward Barton - Pleasanton CA, US
Seema Gururaj - San Jose CA, US
Delbert Hoobler - Horseheads NY, US
Carlos Perez - Watsonville CA, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 9/00

US Classification:

715709000, 715788000

Abstract:

A configuration wizard module facilitates operations to configure an application without having any prior knowledge of the operational details of the application. To this end, the configuration wizard module receives page layout information indicative of a page layout of each configuration wizard page and configuration option data detailing the options of the configuration wizard page(s) to thereby render and display the configuration wizard pages based on the page layout information and the configuration option data, and receives and verifies user input data responsive to the displayed configuration wizard pages. Verified user option values stemming form the user input data is transmitted to the application to facilitate a validation of the verified user option values by the application, which can be configured upon validating all required user option values.

US Patent:

20070226279, Sep 27, 2007

Filed:

Jun 1, 2007

Appl. No.:

11/756644

Inventors:

Edward Barton - Pleasanton CA, US
Avishai Hochberg - San Jose CA, US
James Smith - Redwood City CA, US
Peter Symonds - Morgan Hill CA, US

International Classification:

G06F 12/16

US Classification:

707204000

Abstract:

One aspect of the invention is a method for backing up files, which for example, includes, scanning at least one directory; creating a first list comprising all files at a time tin the scanned at least one directory; saving values of a plurality of attributes, corresponding at the time t, with each file in the first group of files, to create a first snapshot; backing up the files in the first group of files; scanning the at least one directory after backing up the files in the first group of files; creating a second list comprising all files at a time tin the scanned at least one directory; saving values of the plurality of attributes, corresponding at the time t, with each file in the second group of files, to create a second snapshot; and comparing the first snapshot with the second snapshot.

US Patent:

20120166791, Jun 28, 2012

Filed:

Dec 28, 2010

Appl. No.:

12/980024

Inventors:

EDWARD M. BARTON - Dublin CA, US
Len L. Mizrah - San Carlos CA, US

Assignee:

Authernative, Inc. - Redwood City CA

International Classification:

H04L 9/00

US Classification:

713150

Abstract:

Two parties can establish a cryptographic key using a matrix based key exchange protocol, for secure communications without any prior distribution of secret keys or other secret data, and without revealing said key to any third party who may have access to all of the transmissions between them. The two parties use a shared secret to produce a common matrix M. The common matrix M, is multiplied by a random matrix K on the sending side, and a different random matrix N on the receiving side. The matrix product KM is sent from the sending side to the receiving side, and the matrix product MN is sent from the receiving side to the sending side. Both sides produce the common matrix product KMN, and use it for producing a symmetric key for encrypted communications, after mutually authenticating one another over an insecure network.

US Patent:

20150341327, Nov 26, 2015

Filed:

Oct 23, 2012

Appl. No.:

13/658815

Inventors:

EDWARD M. BARTON - DUBLIN CA, US
LEN L. MIZRAH - REDWOOD CITY CA, US

International Classification:

H04L 29/06
H04L 9/32

Abstract:

A party can authenticate itself by interacting with multiple servers without revealing the shared secret to any of the involved parties. The stored shared secret is strengthened and broken into shares and saved on the servers. The shared secret is safe against offline brute force attack unless all servers where the shares are stored are compromised. The compromise of any single server, or multiple servers—but less than the maximum number—will not allow the attacker to do a brute force analysis on the shared secret. This back end security enhancement is suitable for probabilistic front end authentication algorithms.

US Patent:

20140115670, Apr 24, 2014

Filed:

Oct 23, 2012

Appl. No.:

13/658800

Inventors:

EDWARD M. BARTON - DUBLIN CA, US
LEN L. MIZRAH - REDWOOD CITY CA, US

International Classification:

G06F 21/00

US Classification:

726 4, 726 7, 726 6

Abstract:

An interactive method for authentication is based on a shared secret which is in the form of an enumerated pattern of fields on a frame of reference. An instance of the frame of reference comprises an array of characters in which the characters are arranged in a random or other irregular pattern on a grid of content fields. An authentication challenge includes characters from the character set, and is delivered in- or out-of-band. The authentication response includes the enumerated position numbers on the enumerated pattern of the field locations on the grid at which the challenge characters are found.

US Patent:

20140115679, Apr 24, 2014

Filed:

Oct 23, 2012

Appl. No.:

13/658812

Inventors:

Edward M. Barton - Dublin CA, US
Len L. Mizrah - Redwood City CA, US

International Classification:

H04L 9/32

US Classification:

726 7, 726 5

Abstract:

An interactive method for authentication is based on two shared secrets, both shared secrets in the form of an ordered path on the frame of reference. An instance of the frame of reference comprises a set of characters which is arranged in a random or other irregular pattern. The first step of authentication that a user performs requires the user to remember one or all of the characters in the displayed instance of the frame of reference found in the locations in the random subset of the first ordered path by indicating characters either in these locations, or any other locations having the same characters. The second step of authentication requires that a user enter the position of the second ordered path, which only they know during an authentication session, where the challenge identifying the position of the ordered path is the single or multiple values that matches the value of the digital content of the frame of reference.