As part of the PULSAR project, Stealth co-founder Rafail Ostrovsky, in collaboration with Eyal Kushilevitz, Emmanuel Prouff, Adi Rosén, Adrian Thillard, and Damien Vergnaud, published his research on the “Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND” in Volume 35 of the SIAM Journal on Discrete Mathematics.  A link to the corresponding publication, can be found here.