Re: Urgent: Restrict LDAP Queries of a domain user

From the LDAP perspective, you can't restrict this. If the users can read
objects in the tree, then they can use the object as a base DN in a query
and can use subtree, one level or base for their query level.

Joe K.

--
Joe Kaplan-MS MVP Directory Services Programming
Co-author of "The .NET Developer's Guide to Directory Services Programming"
http://www.directoryprogramming.net
--
"Filipe" <clemente.filipe@xxxxxxxxx> wrote in message
news:1181905342.631608.6480@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Hi,

I want to have a Windows 2003 domain user performing LDAP queries only
to a certain scope (subtree) of the entire Active Directory tree. I
only have one Windows 2003 domain.

Is there a way to restrict LDAP queries of a particular user?

Is this possible? If yes, how?

TIA,

Clemente
Portugal



.

Relevant Pages

  • Re: Creating a keytab with ktpass under a Computer account
    ... tree, right click and select New -> Query. ... root, select subtree and type a query like ...
    (comp.protocols.kerberos)
  • Re: Copy-on-write tree data structure
    ... >>Let Node be a suitably defined data structure. ... this could be implemented by creating copies both of the tree ... >>strategy that makes copies of shared subtrees only when a shared subtree ... pointers to the unchanged sub-trees below it. ...
    (comp.lang.c)
  • Re: insert number in binary tree
    ... does anyone know how do we insert numbers in a binary tree? ... If this subtree is empty, ... promoting the right successor of the root will fix this: ...
    (comp.programming)
  • Re: How difficult is the firing squad synchronization problem?
    ... interconnections can reach to a global synchrony. ... Suppose that the tree contains only a root and two children (c1 ... The protocol goes as ... subtree manages its own synchrony. ...
    (comp.theory)
  • Re: insert number in binary tree
    ... we give you the binary tree that has 10 nodes as shown below.. ... Now, starting at root, count the number of nodes in the left subtree. ... doesn't matter; ...
    (comp.programming)