Program security through stack segregation

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Security kernel or utility

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C726S022000

Reexamination Certificate

active

07660985

ABSTRACT:
For each process a stack data structure that includes two stacks, which are joined at their bases, is created. The two stacks include a normal stack, which grows downward, and an inverse stack, which grows upward. Items on the stack data structure are segregated into protected and unprotected classes. Protected items include frame pointers and return addresses, which are stored on the normal stack. Unprotected items are function parameters and local variables. The unprotected items are stored on the inverse stack.

REFERENCES:
patent: 4524416 (1985-06-01), Stanley
patent: 4674032 (1987-06-01), Michaelson
patent: 5107457 (1992-04-01), Hayes et al.
patent: 5913024 (1999-06-01), Green
patent: 5915087 (1999-06-01), Hammond
patent: 5918018 (1999-06-01), Gooderum
patent: 5950195 (1999-09-01), Stockwell et al.
patent: 5983350 (1999-11-01), Minear
patent: 6003084 (1999-12-01), Green
patent: 6058457 (2000-05-01), Tremblay
patent: 6108787 (2000-08-01), Anderson et al.
patent: 6145001 (2000-11-01), Scholl et al.
patent: 6160808 (2000-12-01), Maurya
patent: 6167504 (2000-12-01), Damron
patent: 6198920 (2001-03-01), Doviak et al.
patent: 6219707 (2001-04-01), Gooderum et al.
patent: 6321336 (2001-11-01), Applegate
patent: 6332195 (2001-12-01), Green et al.
patent: 6381646 (2002-04-01), Zhang et al.
patent: 6418324 (2002-07-01), Doviak et al.
patent: 6442661 (2002-08-01), Dreszer
patent: 6490289 (2002-12-01), Zhang et al.
patent: 6557093 (2003-04-01), Vlot et al.
patent: 6578094 (2003-06-01), Moudgill
patent: 6618764 (2003-09-01), Shteyn
patent: 2001/0013094 (2001-08-01), Etoh et al.
patent: 2002/0122394 (2002-09-01), Whitmore et al.
patent: 2002/0144141 (2002-10-01), Edwards et al.
patent: 2003/0017845 (2003-01-01), Doviak et al.
patent: 2004/0103252 (2004-05-01), Lee et al.
M. Seidl, et al., “Segregating Heap Objects by Reference Behavior and Lifetime”, Department of Computer Science, University of Colorado, pp. 12-23.
C. Zou, et al., “Monitoring and Early Warning for Internet Worms”, University of Massachusetts at Amherst, ACM, CCS Oct. 2003, pp. 190-199.
L. Masinter, et al., “Local Optimization in a Compiler for Stack-based Lisp Machines”, Xerox Palo Alto Research Center, pp. 223-230.
M. Leberecht, “The MuSE System: A Flexible Combination of On-Stack Execution and Work-Stealing”, Institut fur Informatik, Germany, pp. 1-14.
J. Neliben, “Buffer Overflows for Dummies”, GSEC Practical Assignment Version 1.4, SANS Institute, May 1, 2002, pp. 1-27.
M. Donaldson, “Inside the Buffer Overflow Attack: Mechanism, Method, & Prevention”, GSEC Version 1.3, SANS Institute, Apr. 3, 2002, pp. 1-24.
D. Barrett, “Using Lifetime Predictors to Improve Memory Allocationj Performance”, Department of Computer Science, University of Colorado, ACM 1993, pp. 187-196.
www.securecomputing.com/pdf/type—enforcement—wp.pdf, “Sidewinder G2 Firewall Type Enforcement Technology—Whitepaper”, Feb. 11, 2003.
N. Weaver, “A Taxonomy of Computer Worms”, WORM '03, ACM, Oct. 27, 2003, pp. 11-18.

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

Program security through stack segregation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Program security through stack segregation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Program security through stack segregation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4214775

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