  We prove that Kilian's four-message succinct argument system is post-quantum
secure in the standard model when instantiated with any probabilistically
checkable proof and any collapsing hash function (which in turn exist based on
the post-quantum hardness of Learning with Errors).
  At the heart of our proof is a new "measure-and-repair" quantum rewinding
procedure that achieves asymptotically optimal knowledge error.
