Information security – Access control or authentication – Network
Reexamination Certificate
2007-12-25
2007-12-25
Lanier, Benjamin E. (Department: 2132)
Information security
Access control or authentication
Network
C726S012000, C726S014000, C709S223000, C709S224000, C709S225000
Reexamination Certificate
active
10462937
ABSTRACT:
A system, method and program storage device tangibly embodying a program of instructions for determining whether to allow transmission of data from a source destined for a destination over a network, comprising: acquiring a string of a predetermined length in bits (L) from the data; partitioning the acquired string into a partition of phrases, each of the phrases in the partition being unique and having one or more bits; determining a number of phrases (N) in the partition; estimating a normalized complexity (C) for the Kolmogorov Complexity in the acquired string viaC≡N2L;and evaluating whether to allow transmission of the data based on a comparison of whether the normalized complexity estimate (C) is within a predetermined normal complexity estimate band.
REFERENCES:
patent: 4814746 (1989-03-01), Miller et al.
patent: 4935882 (1990-06-01), Pennebaker et al.
patent: 5465219 (1995-11-01), Jeffers
patent: 5506580 (1996-04-01), Whiting et al.
patent: 5532694 (1996-07-01), Mayers et al.
patent: 5602964 (1997-02-01), Barrett
patent: 5608396 (1997-03-01), Cheng
patent: 5627534 (1997-05-01), Craft
patent: 5635931 (1997-06-01), Franaszek
patent: 5652581 (1997-07-01), Furlan et al.
patent: 5836003 (1998-11-01), Sadeh
patent: 5867114 (1999-02-01), Barbir
patent: 5886655 (1999-03-01), Rust
patent: 6018303 (2000-01-01), Sadeh
patent: 6088452 (2000-07-01), Johnson et al.
patent: 6122379 (2000-09-01), Barbir
patent: 6281816 (2001-08-01), Kampf
patent: 6309424 (2001-10-01), Fallon
patent: 6373411 (2002-04-01), Shoham
patent: 6377930 (2002-04-01), Chen et al.
patent: 6400289 (2002-06-01), Banerji
patent: 6404931 (2002-06-01), Chen et al.
patent: 2001/0003165 (2001-06-01), Van Der Vleutenet et al.
patent: 2002/0101367 (2002-08-01), Geiger et al.
“Active Network Management, Kolmogorov Complexity, and Streptichrons,” A.B. Kulkarni, General Electric Company, GE Research & Development Center, Dec. 2000, pp. 1-16.
“Detecting Distributed Denial-of-Service Attacks Using Kolmogorov Complexity Metrics,” A.B. Kulkarni, General Electric Company, GE Research & Development Center, Dec. 2001, pp. 1-7.
“Information Assurance through Kolmogorov Complexity,” Scott Evans, General Electric Company, GE Research & Development Center, Jun. 2001, pp. 1-10.
“Symbol Compression Ratio for String Compression and Estimation of Kolmogorov complexity, ”S.C. Evans et al., General Electric Company, GE Research & Development Center, Nov. 2001, Technical Information Series.
“Code Compression”, Jens Ernst et al., Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design on Implementation (PLDI): xxx-yyy, 1997.
“Universal Prediction”, Neir Merhav, IEEE Transactions of Information Theory, vol. 44, No. 6, Oct. 1998, pp. 2124-2147.
“Fifty Years of Shannon Theory,” Sergio Verdu, IEEE Transactions of Information Theory, vol. 44, No. 6, Oct. 1998, pp. 2057-2078.
“Source Codes as Random Number Generators”, Karthik Visweswariah, et al., IEEE Transactions on Information Theory, vol. 44, No. 2, Mar. 1998, pp. 462-471.
“Network Security Through Conservation of Complexity”, Scott c. Evans et al., paper No. 710 submitted to MILCOM Mar. 8, 2002, unclassified.
“Condensing Computable Scenes Using Visual Complexity and Film Syntax Analysis” Hari Sundaram, et al., ICME 2001, Aug. 22-27, Tokyo Japan.
“Four Stage Model of Data Compression”, Wikipedia, the free encyclopedia, www.wikipedia.org/w/wiki.phtml?title=Four—stage—model—of—data—compression.
“Data compression/four stage compression model”, Wikipedia, the free encyclopedia.
“Syntactic Measures of Complexity Appendix 1—A Brief Overview of Some Existing Formulations of Complexity”, Bruce Edmonds, http://cfpm.org/pub/users/bruce/thesis/appen1.pdf.
Huffman/Lempel-Ziv Compression Methods, www.dcs.napier.ac.uk/˜bill/pdf/ADCO—C03.PDF.
“IBRAC: Image-Based Rendering Acceleration and Compression” Iimi Yoon et al, http//graphics.usc.edu/cgit/pdf/papers/hp.pdf.
Evans Scott C.
Hershey John E.
Saulnier Gary J.
Lanier Benjamin E.
Lockheed Martin Corporation
Prass & Irving, LLP
Prass, Jr. Ronald E.
LandOfFree
Data transmission system utilizing efficient complexity... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data transmission system utilizing efficient complexity..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data transmission system utilizing efficient complexity... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3830387