Matthew A Blaze

US Patent:

6789068, Sep 7, 2004

Filed:

Nov 8, 1999

Appl. No.:

09/436081

Inventors:

Matthew A. Blaze - New York NY
John Ioannidis - New York NY
Angelos Keromytis - Philadelphia PA

Assignee:

ATT Corp. - New York NY

International Classification:

G06F 1760

US Classification:

705 64, 705 75

Abstract:

The present invention provides a microbilling system that integrates with existing billing systems and existing devices. In a preferred embodiment of the invention, the devices store digital certificates with short-lived expiration dates and specifying transaction limits, preferably using a trust management system. A provisioning agent periodically (e. g. , once a day) issues the certificates over a secure channel to the devices. When conducting a purchase transaction, the devices exchange certificates via a communication channel (that need not be secure) and the purchasing device issues a digitally signed electronic check which is periodically deposited over an advantageously secure channel with a clearing service. The present invention enables microbilling transactions by embedding liability in the certificates.

US Patent:

7650313, Jan 19, 2010

Filed:

Jun 12, 2004

Appl. No.:

10/866060

Inventors:

Matthew A. Blaze - New York NY, US
John Ioannidis - New York NY, US
Angelos Keromytis - Philadelphia PA, US

Assignee:

AT&T Corp. - New York NY

International Classification:

H04K 1/00
G06F 17/60

US Classification:

705 64, 705 67

Abstract:

The present invention provides a microbilling system that integrates with existing billing systems and existing devices. In a preferred embodiment of the invention, the devices store digital certificates with short-lived expiration dates and specifying transaction limits, preferably using a trust management system. A provisioning agent periodically (e. g. , once a day) issues the certificates over a secure channel to the devices. When conducting a purchase transaction, the devices exchange certificates via a communication channel (that need not be secure) and the purchasing device issues a digitally signed electronic check which is periodically deposited over an advantageously secure channel with a clearing service. The present invention enables microbilling transactions by embedding liability in the certificates.

US Patent:

7996325, Aug 9, 2011

Filed:

Dec 7, 2009

Appl. No.:

12/653019

Inventors:

Matthew A. Blaze - New York NY, US
John Ioannidis - New York NY, US
Angelos Keromytis - Philadelphia PA, US

Assignee:

AT&T Intellectual Property II, LP - Atlanta GA

International Classification:

H04K 1/00
G06F 17/60

US Classification:

705 64, 705 67

Abstract:

The present invention provides a microbilling system that integrates with existing billing systems and existing devices. In a preferred embodiment of the invention, the devices store digital certificates with short-lived expiration dates and specifying transaction limits, preferably using a trust management system. A provisioning agent periodically (e. g. , once a day) issues the certificates over a secure channel to the devices. When conducting a purchase transaction, the devices exchange certificates via a communication channel (that need not be secure) and the purchasing device issues a digitally signed electronic check which is periodically deposited over an advantageously secure channel with a clearing service. The present invention enables microbilling transactions by embedding liability in the certificates.

US Patent:

20010018675, Aug 30, 2001

Filed:

Feb 9, 2001

Appl. No.:

09/780892

Inventors:

Matthew Blaze - New York NY, US
Joan Feigenbaum - New York NY, US
Martin Strauss - Summit NJ, US

International Classification:

G06F017/60

US Classification:

705/035000, 705/036000

Abstract:

A method and apparatus are provided for compliance checking in a trust-management system. A request r, a policy assertion (ƒ, POLICY), and n-1 credential assertions (ƒ, s) . . . , (ƒ, s) are received, each credential assertion comprising a credential function ƒand a credential source s. Each assertion may be monotonic, authentic, and locally bounded. An acceptance record set S is initialized to {( , , R)}, where represents a distinguished null string, and R represents the request r. Each assertion (ƒ, s), where i represents the integers from n-1 to 0, is run and the result is added to the acceptance record set S. This is repeated mn times, where m represents a number greater than and an acceptance is output if any of the results in the acceptance record set S comprise an acceptance record (0, POLICY, R).

US Patent:

59094940, Jun 1, 1999

Filed:

Feb 14, 1997

Appl. No.:

8/800701

Inventors:

Matthew A. Blaze - New York NY

Assignee:

AT&T Corp. - Middletown NJ

International Classification:

H04L 900

US Classification:

380 37

Abstract:

A pseudo-random bit generator using at least one N-round Feistel construction that uses random functions. A block of data is permuted and divided into a stream word and a modification word. The stream word is used to build the pseudo-random bitstream. The modification word is used to modify a selected element of a random function used in a Feistel construction. When a single Feistel construction is used, its random functions are dynamically changed by the modification words as they are generated. When a plurality of Feistel constructions are used, the random functions of a selected inactive construction are modified by modification words generated by an active construction. When all of the elements of all of the functions of the inactive construction have been modified, the active and inactive functions are exchanged.

US Patent:

56968230, Dec 9, 1997

Filed:

Mar 31, 1995

Appl. No.:

8/415015

Inventors:

Matthew A. Blaze - Jersey City NJ

Assignee:

Lucent Technologies Inc. - Murray Hill NJ

International Classification:

H04L 908
H04L 900

US Classification:

380 21

Abstract:

A cryptographic system enables a secure, but low-bandwidth, cryptographic module, such as a smartcard or PCMCIA device, to serve as a high-bandwidth secret-key encryption decryption engine which uses the processing power of an untrusted, but fast, host processor without revealing the secret key to that host processor.

US Patent:

60059443, Dec 21, 1999

Filed:

Feb 14, 1997

Appl. No.:

8/800703

Inventors:

Matthew A. Blaze - Hoboken NJ

Assignee:

AT&T Corp - Middletown NJ

International Classification:

H04L 900

US Classification:

380 42

Abstract:

An efficient block cipher that operates on blocks of arbitrarily large size. A block is permuted by recursively using relatively small random functions in an N-round Feistel construction, where N is an integer. The security of the invention is closely related to the difficulty of solving the Numerical Matching with Target Sums problem, an NP Complete problem which cannot presently be solved analytically using known mathematical techniques. The memory required for the cipher's random functions increases linearly with block size, rather than exponentially as with known Feistel constructions. The invention can be efficiently and practically implemented in software at speeds comparable to the speeds of known ciphers.

US Patent:

55747817, Nov 12, 1996

Filed:

Dec 8, 1994

Appl. No.:

8/351918

Inventors:

Matthew A. Blaze - Jersey City NJ

Assignee:

AT&T - Holmdel NJ

International Classification:

H04M 300
H04M 700

US Classification:

379220

Abstract:

A communications system is arranged to route a database-queried call (900-number or 800-number call) to a subscriber (pay-per-call sponsor or 800-number customer), and to deliver to the subscriber information identifying the call as a database-queried call, as opposed to a switched-line or POTS call.