We put forward a new type of computationally-sound proof systems, called universal-arguments, which are related but diierent from both CS-proofs (as deened by Micali) and arguments (as deened by Brassard, Chaum and Crepeau). In particular, we adopt the instance-based prover-eeciency paradigm of CS-proofs, but follow the computational-soundness condition of argument systems (i.e., we consider on...