Method and apparatus for dynamic, seamless security in...

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular node for directing data and applying cryptography

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C726S003000, C726S014000

Reexamination Certificate

active

07865717

ABSTRACT:
Communication nodes, acting as intermediate routers for communication packets transmitted between a source node and a destination node, are provided with different access rights to the fields of the routed communication packets. Routes of intermediate routers between the source node and the destination node are discovered and the identities of intermediate routers on the discovered routes are collected. The aggregate trust levels of the intermediate routers are computed allowing the most trusted route to be selected. Encryption keys are securely distributed to intermediate routers on the most trusted route based on the trust level of the intermediate routers and fields of the communication packets are encrypted with encryption keys corresponding to the assigned trust level. Intermediated nodes are thereby prevented from accessing selected fields of the communication packets.

REFERENCES:
patent: 6092191 (2000-07-01), Shimbo et al.
patent: 7068791 (2006-06-01), Larsen et al.
patent: 7234063 (2007-06-01), Baugher et al.
patent: 2002/0112154 (2002-08-01), Wallace, Jr.
patent: 2003/0167342 (2003-09-01), Munger et al.
patent: 2004/0025018 (2004-02-01), Haas et al.
patent: 2005/0198282 (2005-09-01), Stahl et al.
patent: 2005/0198351 (2005-09-01), Nog et al.
patent: 2005/0216727 (2005-09-01), Chattopadhyay et al.
patent: 2005/0216730 (2005-09-01), Morino et al.
patent: 2005/0235362 (2005-10-01), England et al.
patent: 2005/0251491 (2005-11-01), Medina et al.
patent: 2005/0251680 (2005-11-01), Brown et al.
patent: 2006/0173968 (2006-08-01), Vaarala et al.
patent: 2007/0113274 (2007-05-01), Hariharan et al.
patent: 2007/0186281 (2007-08-01), McAlister
patent: 2007/0258468 (2007-11-01), Bennett
patent: 2007/0297405 (2007-12-01), He
patent: 2008/0222415 (2008-09-01), Munger et al.
patent: 1 571 790 (2005-07-01), None
patent: WO 2006/070172 (2006-07-01), None
Pirzada et al., “Establishing Trust In Pure AD-hoc Networks”, School of Computer & Software Engineering, The University of Western Australia, Jan. 18, 2004.
Xiaoqi et al., “A Traust Model Based Routing Protocol for Secure Ad Hoc Networks”, Department of Computer Sience and Engineering, The Chinese University of Honk Kong, 2004 IEEE Aerospace Conference Proceedings.
Zhaoyu et al., “A Dynamic Trust Model for Mobile Ad Hoc Networks”, Department of Software and Information Systems, University of North Carolina at Charlotte, Charlotte, NC 28223, USA, Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Comuting Systems (FTDCS'04), 0-7695-2118-5/04, 2004 IEEE.
Sanzgiri, et al., “A Secure Routing Protocol for Ad Hoc Networks,” Network Protocols, 2002. Proceedings 10th IEEE International Conference, Nov. 12-15, 2002, Piscataway, NJ, USA, IEEE, Nov. 12, 2002, pp. 78-87.
Chung Kei Wong, et al., “Secure Group Communications Using Key Graphs,” IEEE/ACM transactoin on Networking, vol. 8, No. 1, Feb. 2000, 1-15.
PCT International Searh Report Dated Nov. 22, 2007.

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

Method and apparatus for dynamic, seamless security in... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for dynamic, seamless security in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for dynamic, seamless security in... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2689543

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