We consider the problem of designing and analyzing differentially private
algorithms that can be implemented on {\em discrete} models of computation in
{\em strict} polynomial time, motivated by known attacks on floating point
implementations of real-arithmetic differentially private algorithms (Mironov,
CCS 2012) and the potential for timing attacks on expe