Identifying unauthorized communication systems using a...

Electrical computers and digital processing systems: multicomput – Computer-to-computer session/connection establishing – Network resources access controlling

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S224000, C717S177000

Reexamination Certificate

active

10058338

ABSTRACT:
An authorized client communication system seeking access to a host communication system may be identified by performing a mathematical computation on a client communication system-specific identifier and an access password. Communications from the client communication system are terminated if the result of the mathematical computation does not correspond to an authorized client communication system. Another aspect involves storing information about an authorized client communication system.

REFERENCES:
patent: 4964163 (1990-10-01), Berry
patent: 5091939 (1992-02-01), Cole et al.
patent: 5365580 (1994-11-01), Morisaki
patent: 5375169 (1994-12-01), Seheidt et al.
patent: 5402492 (1995-03-01), Goodman et al.
patent: 5416840 (1995-05-01), Cane et al.
patent: 5491752 (1996-02-01), Kaufman et al.
patent: 5506905 (1996-04-01), Markowski et al.
patent: 5515426 (1996-05-01), Yacenda et al.
patent: 5579126 (1996-11-01), Otsuka
patent: 5584022 (1996-12-01), Kikuchi et al.
patent: 5606609 (1997-02-01), Houser et al.
patent: 5638448 (1997-06-01), Nguyen
patent: 5666415 (1997-09-01), Kaufman
patent: 5715390 (1998-02-01), Hoffman et al.
patent: 5719941 (1998-02-01), Swift et al.
patent: 5737421 (1998-04-01), Audebert
patent: 5751812 (1998-05-01), Anderson
patent: 5784565 (1998-07-01), Lewine
patent: 5802176 (1998-09-01), Audebert
patent: 5805816 (1998-09-01), Picazo et al.
patent: 5826029 (1998-10-01), Gore et al.
patent: 5841871 (1998-11-01), Pinkas
patent: 5857021 (1999-01-01), Kataoka et al.
patent: 5862218 (1999-01-01), Steinberg
patent: 5887065 (1999-03-01), Audebert
patent: 5892828 (1999-04-01), Perlman
patent: 5918009 (1999-06-01), Gehani et al.
patent: 5949152 (1999-09-01), Tagawa et al.
patent: 5956633 (1999-09-01), Janhila
patent: 5983273 (1999-11-01), White et al.
patent: 6005943 (1999-12-01), Cohen et al.
patent: 6044471 (2000-03-01), Colvin
patent: 6049670 (2000-04-01), Okada et al.
patent: 6072876 (2000-06-01), Obata et al.
patent: 6073123 (2000-06-01), Staley
patent: 6073234 (2000-06-01), Kigo et al.
patent: 6128588 (2000-10-01), Chacon
patent: 6134593 (2000-10-01), Alexander et al.
patent: 6134659 (2000-10-01), Sprong et al.
patent: 6141759 (2000-10-01), Braddy
patent: 6161185 (2000-12-01), Guthrie et al.
patent: 6202158 (2001-03-01), Urano et al.
patent: 6230269 (2001-05-01), Spies et al.
patent: 6236975 (2001-05-01), Boe et al.
patent: 6341352 (2002-01-01), Child et al.
patent: 6431875 (2002-08-01), Elliott et al.
patent: 6446052 (2002-09-01), Juels
patent: 6502192 (2002-12-01), Nguyen
patent: 6564232 (2003-05-01), Cole et al.
patent: 6615353 (2003-09-01), Hashiguchi
patent: 6657956 (2003-12-01), Sigaud
patent: 6665800 (2003-12-01), Jaber
patent: 6694436 (2004-02-01), Audebert
patent: 6738810 (2004-05-01), Kramer et al.
patent: 6742129 (2004-05-01), Higgs et al.
patent: 6801946 (2004-10-01), Child et al.
patent: 6807451 (2004-10-01), Shida et al.
patent: 6826686 (2004-11-01), Peyravian et al.
patent: 6829712 (2004-12-01), Madoukh
patent: 6834112 (2004-12-01), Brickell
patent: 6836651 (2004-12-01), Segal et al.
patent: 6871276 (2005-03-01), Simon
patent: 6883095 (2005-04-01), Sandhu et al.
patent: 6889212 (2005-05-01), Wang et al.
patent: 6904526 (2005-06-01), Hongwei
patent: 6910135 (2005-06-01), Grainger
patent: 6928558 (2005-08-01), Allahwerdi et al.
patent: 6954861 (2005-10-01), Watkins et al.
patent: 7062655 (2006-06-01), Nelson et al.
patent: 2001/0044898 (2001-11-01), Benussi et al.
patent: 2002/0013737 (2002-01-01), Arai
patent: 2002/0059110 (2002-05-01), Yamamoto et al.
patent: 2002/0067832 (2002-06-01), Jablon
patent: 2002/0095487 (2002-07-01), Day et al.
patent: 2002/0143938 (2002-10-01), Alexander et al.
patent: 2002/0172363 (2002-11-01), Dierks et al.
patent: 2002/0184501 (2002-12-01), Bin Abdul Rahman et al.
patent: 2003/0041268 (2003-02-01), Hashimoto
patent: 2003/0046587 (2003-03-01), Bheemarasetti et al.
patent: 2003/0051083 (2003-03-01), Striemer
patent: WO 99/66422 (1999-12-01), None
RFC 2759. The Change Password (version 1) and Change Password (version 2) packets www.tzi.de/˜cabo/pdfrfc/rfc2759.txt.pdf.
A Framework For An Adaptive Intrusion Detection System With . . . —Hossain, Bridges (2001) www.cs.msstate.edu/˜bridges/papers/citss-2001.pdf.
From Formal Security Specifications to Executable Assertions . . . —Cristina Serban (1995) www.cs.umr.edu/techreports/95-01.ps.
A Dynamic Intrusion-Detection Methodology—Munson, Elbaum www.soft-metrics.com/docs/Theoretical.pdf.
Detecting Anomalous and Unknown Intrusions Against Programs—Ghosh, Wanken, Charron (1998) ftp.rstcorp.com/pub/papers/acsac98.ps.
Using SPKI Certificates for Authorization in CORBA based . . . —Lampinen (1999) www.tcm.hut.fi/Research/TeSSA/Papers/Lampinen/Lampinen-NordSec99.ps.
Intrusion Detection Applying Machine Learning to Solaris Audit Data—Endler (1998) www.cs.umbc.edu/cadip/docs/NetworkIntrusion/endler98.ps.
Krim, Jonathan, “Opening a New Windows Activation,”The Washington Post, Sunday, Oct. 21, 2001, p. H7.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Identifying unauthorized communication systems using a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Identifying unauthorized communication systems using a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Identifying unauthorized communication systems using a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3957148

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.