Loops II

• From: Tim Ellison/OTT/OTI <Tim_Ellison@oti.com>
• Date: Wed, 15 Mar 2000 15:33:39 -0500
• To: w3c-dist-auth@w3.org
• Message-ID: <OF5873FF21.594AD7B0-ON852568A3.00707BD7@ott.oti.com>

An observation:
Although infinite loops are broken using Loop Detected rules, since all
(non-circular) paths are returned by deep operations it is trivial to
construct an n**m walks graph by having n levels with m bindings between
each.
This would be a prime candidate for denial of service type attacks against
a server.

Tim

Received on Wednesday, 15 March 2000 15:34:54 UTC