Date: 1999/7/28
      Name: Rene Peralta
      Yale University

      The talk will present the notion of a "discreet proof of knowledge". The length of such proofs is related to the number of conjunctions sufficient to build circuits for boolean functions over the base (XOR, NOT,AND). Recent results regarding the latter problem will be described. Finally, an application to UNIX remote logins will be presented.