Electrical computers and digital processing systems: multicomput – Distributed data processing – Client/server
Reexamination Certificate
2006-03-15
2008-10-28
Dinh, Khanh (Department: 2151)
Electrical computers and digital processing systems: multicomput
Distributed data processing
Client/server
C709S224000, C713S156000, C726S005000
Reexamination Certificate
active
07444372
ABSTRACT:
A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.
REFERENCES:
patent: 5671279 (1997-09-01), Elgamal
patent: 5793365 (1998-08-01), Tang et al.
patent: 5987376 (1999-11-01), Olson et al.
patent: 5999711 (1999-12-01), Misra et al.
patent: 6038296 (2000-03-01), Brunson et al.
patent: 6167279 (2000-12-01), Chang et al.
patent: 6233606 (2001-05-01), Dujari
patent: 6397303 (2002-05-01), Arimilli et al.
patent: 6405290 (2002-06-01), Arimilli et al.
patent: 6557102 (2003-04-01), Wong et al.
patent: 6718470 (2004-04-01), Adams
patent: 6941366 (2005-09-01), Antes et al.
patent: 6941384 (2005-09-01), Aiken, Jr. et al.
patent: 7107269 (2006-09-01), Arlein et al.
patent: 7299351 (2007-11-01), Huitema et al.
patent: 7333482 (2008-02-01), Johansson et al.
patent: 2002/0032592 (2002-03-01), Krasnick et al.
patent: 2002/0080752 (2002-06-01), Johansson et al.
patent: 2002/0133500 (2002-09-01), Arlein et al.
patent: 2002/0143989 (2002-10-01), Huitema et al.
patent: 2002/0156875 (2002-10-01), Pabla
patent: 2003/0018813 (2003-01-01), Antes et al.
patent: 2003/0097410 (2003-05-01), Atkins et al.
patent: 2003/0158864 (2003-08-01), Samn
patent: 2003/0196060 (2003-10-01), Miller
patent: 2004/0145608 (2004-07-01), Fay et al.
patent: 2005/0004985 (2005-01-01), Stochosky
patent: 2005/0027581 (2005-02-01), Kjesbu et al.
patent: 2005/0027800 (2005-02-01), Erickson et al.
patent: 1 248 441 (2002-10-01), None
patent: WO-02084948 (2002-10-01), None
patent: WO-2005029372 (2005-03-01), None
Partial European Search Report for EP 03 00 7907, dated Jun. 21, 2005.
Kim et al., “A Secure Platform for Peer-to-Peer Computing in the Internet,” Proceedings of the 35th Hawaii International Conference on System Sciences, IEEE Computer Society, 2002, pp. 3948-3957.
Mazieres et al., “Separating Key Management from File System Security,” Operating Systems Review ACM, vol. 33, No. 5, Dec. 1999, pp. 124-139.
Ajmani et al., “ConChord: Cooperative SDSI Certificate Storage and Name Resolution,” First International Workshop on Peer-to-Peer Systems (IPTPS), Mar. 2002.
Dabek, F., et al.,Building Peer-to-Peer Systems With Chord, a Distributed Lookup Serivce, at MIT Laboratory for Computer Science, 6 pages, at http://pdos.Ics.mit.edu/chord.
Druschel, P., et al., Past: A large-scale, persistent peer-to-peer storage utility, at Rice University and Microsoft Research, 6 pages.
Ellison, C., et al., Simple Public Key Certificate, (Internet Draft 1999), at http://www.world.std.com/˜cme/spki.txt (Aug. 6, 2001).
Ellison, C., et al., SPKI Certificate Theory, (The Internet Society 1999), at http://www.ietf.org/rfc/rfc2693.txt?number=2693 (Aug. 6, 2001).
Ellison, C., SPKI Requirements, (The Internet Society 1999), at http://www.ietf.org/rfc/rfc2692.txt?number=2692 (Aug. 6, 2001).
Erdelsky, P., The Birthday Paradox, EFG, at http://www.efgh.com/math/birthday.htm (Mar. 8, 2002).
Lai, K. et al., Measuring Link Bandwidths Using a Deterministic Model of Packet Delay, at Department of Computer Science at Stanford University, 13 pages.
Langley, A., The Freenet Protocol, The Free Network Project, at http://freenet.sourceforge.net/index/php?page=protocol (May 21, 2001).
Red-Black Tree, National Institute of Standards and Technology, at http://www.nist.gov/dads/HTML/redblack.html (Mar. 5, 2002).
Rowstron et al., Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, at Microsoft Research, Ltd., St. George House and Rice University, 20 pages.
Rowstron et al., Scribe: The design of a large-scale event notification infrastructure, at Microsoft Research, Ltd., St. George House and Rice University, 20 pages.
Rowstron et al., Storage management and caching in Past, a large-scale, persistent peer-to-peer storage utility, at Microsoft Research, Ltd., St. George House and Rice University, 14 pages.
Perey, et al, “Working Together in Virtual Facilities,” NetworkWorld Website, 7 pages printed Jul. 1, 2005 from http://www.networkworld.com/reviews/2003/0728bgmain.html.
“Collaborative Program Management for the 21st Century Enterprise,” Paragon Dynamics, 4 pages printed Jul. 5, 2005 from <http://www.paragondynamics.com/dynamic/marketing/> Pace Feature—3—single—page.pdf.
“Live Meeting Overview,” 3 pages printed Jul. 1, 2005 from <http://www.microsoft.com/office/livemeeting/prodinfo/overview.mspx>.
“FVC Launces Click to Meet Express 2.0,” The Wainhouse Research Bulletin, Apr. 22, 2003, vol. 4, #17 (3 pages).
“SAIC Collaboration System: Knowledge Through Distributed Interaction,” 8 pages printed Jul. 1, 2005 from <http://www.saic.com/products/software/collaboration/scs.pdf>.
“Arel Spotlight Application Suite,” 11 pages printed Jul. 1, 2005 from http://www.arelcom.com/conferencing.html.
Gavrilescu Alexandru
Gupta Rohit
Miller John L.
Wheeler Graham A.
Dinh Khanh
Microsoft Corporation
LandOfFree
Peer-to-peer name resolution protocol (PNRP) security... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Peer-to-peer name resolution protocol (PNRP) security..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Peer-to-peer name resolution protocol (PNRP) security... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4009378