The paper introduces novel techniques for "for-all" one-bit compressed sensing. It improves on the existing results, for instance by showing approximate recovery with k*log(n/k) + 1/eps measurements for eps-recovery, and by extending the O(k^2 log n) support recovery guarantee to explicit constructions. While the novelty is very limited, it is a compelling result for the compressive sensing community.